ppxscal/embedding_network huggingface dataset:
On the solution of multi-point constraints - Application to FE analysis of reinforced concrete structures
Authors: Libor Jendele, Jan ervenka
Venue: Computers and Structures (2009)

The paper presents an efficient way of implementing general multi-point constraint conditions in a finite element solver. The proposed method of applying and processing the multi-point constraints on the primary unknown variables of finite element method is computationally efficient and memory economical, because all constrained degrees of freedoms (DOFs) are already eliminated during the assembly of the global stiffness matrix and right-hand side vectors. The adopted concept has a wide range of use, and several of its possibilities are discussed. At the end of the paper, sample analyses of reinforced concrete structures are presented that demonstrate the advantages of the developed form for modelling discrete reinforcement bars in non-linear FE calculation in engineering practice.
Efficient rule based structural algorithms for classification of tree structured data
Authors: Mostafa Haghir Chehreghani, Morteza Haghir Chehreghani, Caro Lucas, Masoud Rahgozar, Euhanna Ghadimi
Venue: Intelligent Data Analysis (2009)

Recently, tree structures have become a popular way for storing and manipulating huge amount of data. Classification of these data can facilitate storage, retrieval, indexing, query answering and different processing operations. In this paper, we present C-Classifier and M-Classifier algorithms for rule based classification of tree structured data. These algorithms are based on extracting especial tree patterns from training dataset. These tree patterns, i.e. closed tree patterns and maximal tree patterns are capable of extracting characteristics of training trees completely and non-redundantly. Our experiments show that M-Classifier significantly reduces running time and complexity. As experimental results show, accuracies of M-Classifier and C-Classifier depend on whether or not we want to classify all of the data points (even uncovered data). In the case of complete classification, C-Classifier shows the best classification quality. On the other hand and in the case of partial classification, M-Classifier improves classification quality measures.
Hybrid argumentation and its properties
Authors: Dorian Gaertner, Francesca Toni
Venue: Proceeding of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008 (2008)

We present a variant of AB-dispute derivations for assumption-based argumentation (ABA), that can be used for determining the admissibility of claims. ABA reduces the problem of computing arguments to the problem of computing assumptions supporting these arguments. Whereas the original AB-dispute derivations only manipulate sets of assumptions, our variant also renders explicit the underlying dialectical structure of arguments (by a proponent) and counter-arguments (by an opponent), and thus supports a hybrid of ABA and abstract argumentation beneficial to developing applications of argumentation where explicit justifications of claims in terms of full dialectical structures are required. We prove that the proposed variant of AB-dispute derivations is correct.
A featureless and stochastic approach to on-board stereo vision system pose
Authors: Fadi Dornaika, Angel D. Sappa
Venue: Image and Vision Computing (2009)

This paper presents a direct and stochastic technique for real-time estimation of on-board stereo head's position and orientation. Unlike existing works which rely on feature extraction either in the image domain or in 3D space, our proposed approach directly estimates the unknown parameters from the stream of stereo pairs' brightness. The pose parameters are tracked using the particle filtering framework which implicitly enforces the smoothness constraints on the estimated parameters. The proposed technique can be used with a driver assistance applications as well as with augmented reality applications. Extended experiments on urban environments with different road geometries are presented. Comparisons with a 3D data-based approach are presented. Moreover, we provide a performance study aiming at evaluating the accuracy of the proposed approach.
Inferring Queue State by Measuring Delay in a WiFi Network
Authors: David Malone, Douglas J Leith, Ian Dangerfield
Venue: Proceedings of the First International Workshop on Traffic Monitoring and Analysis (2009)

Packet round trip time is a quantity that is easy to measure for end hosts and applications. In many wired networks, the round trip has been exploited for purposes such as congestion control and bandwidth measurement because of relatively simple relationships between buffer occupancy and drain time. In 802.11 networks, the buffer drain times show considerable variability due to the random nature of the MAC service. We examine some of the problems faced when using round-trip-time-based queue estimates in these networks, particularly in relation to congestion control.
Prototype and script.aculo.us: You Never Knew JavaScript Could Do This!
Authors: Christophe Porteneuve
Venue:  (2007)

Tired of getting swamped in the nitty-gritty of cross-browser, Web 2.0-grade JavaScript? Get back in the game with Prototype and script.aculo.us, two extremely popular JavaScript libraries, that make it a walk in the park. Be it AJAX, drag and drop, auto-completion, advanced visual effects, or many other great features, all you need is write one or two lines of script that look so good they could almost pass for Ruby code! Web applications are getting richer and richer, with more interaction baked in every day. But JavaScript, DOM, CSS and a full host of other Web standards are quite complex, and the result isn't always browser compliant. The Prototype and script.aculo.us libraries are veritable treasure troves, smoothing over all the usual nitty-gritty differences between browsers, and making most common features a breeze to implement. With this book, you can quickly wield the whole power of these extraordinary libraries. Dive into Prototype, the library that makes JavaScript so much more powerful, and it looks a lot like Ruby code. Exploring the DOM, handling events, taming AJAX, and radically simplifying most of your scripting code: it all becomes easy-and very portable-with Prototype. When it comes to advanced UI features, script.aculo.us is every web developer's dream come true: whether you need to create auto-completed text inputs, implement in-place editors, provide customized drag-and-drop behaviors, capture your users' attention with visual effects or simply build DOM fragments more efficiently, it's all there, and lightweight too. This book guides you through all the details of these features, letting you use many technologies on the server side, such as PHP, vanilla Ruby, and Ruby On Rails, in countless examples illustrating every aspect. Power users will also learn the design philosophies of the libraries, and how to contribute to them and augment them for their own needs. 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
Silicon nanowire NVM with high-k gate dielectric stack
Authors: Xiaoxiao Zhu, D. Gu, Qiliang Li, D. E. Ioannou, H. Baumgart, J. S. Suehle, C. A. Richter
Venue: Microelectronic Engineering (2009)

Three flash memory cell structures with silicon nanowire channels and high-k dielectric stacks were fabricated with a ''self-aligning'' process and their characteristics are reported and compared in this paper: a Metal/SiO"2/HfO"2/SiO"2/Si (MOHOS) cell with a SiO"2 blocking layer and two Metal/Al"2O"3/HfO"2/SiO"2/Si (MAHOS) cells with Al"2O"3, all with HfO"2 as the charge trapping layer. Compared to (control) planar cells, all three operate at higher speeds, attributed to the enhanced electric field across the tunneling oxide surrounding the channel. The MAHOS cells (Al"2O"3 blocking layer) outperform the MOHOS cells (SiO"2 blocking layer) and both have large memory window, fast operation speed, good endurance and retention.
Rate-distortion optimized network coding for cooperative video stream repair in wireless peer-to-peer networks
Authors: Xin Liu, Gene Cheung, Chen-Nee Chuah
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

By providing coding ability at intermediate nodes, network coding has been shown to improve network throughput in broadcast/multicast wireless networks. In this paper, we show that by imposing coding structure, network coding can be further optimized specifically for video streaming in a rate-distortion manner, in a scenario where wireless adhoc peers cooperatively relay packets to each other to repair packet losses during MBMS broadcast. Experimental results show that our proposed scheme can improve video quality noticeably, by up to 19.71dB over un-repaired video stream and by up to 7.90dB over video stream using traditional unstructured network coding.
Iterated least-squares performance evaluation with real data for real time ambiguity resolution
Authors: Leandro Baroni, Hélio Koiti Kuga
Venue: Proceedings of the 8th WSEAS international conference on Signal processing, robotics and automation (2009)

The Global Positioning System (GPS) is a satellite-based navigation system which allows the user to determine position and time with high precision. However, phase measurements has an inherent difficulty, which is the ambiguity determination in number of signal wavelengths. Once ambiguities are resolved, positioning can reach sub-meter accuracies. The purpose of this work is to estimate the position coordinates of a GPS receiver using double differenced phase positioning techniques and evaluate accuracy of the solution. The performance of ambiguity resolution, with LSAST and LAMBDA methods, and an iterated least-squares estimator are evaluated and positioning errors are shown with half meter level for static and less than meter level for kinematic positioning.
Evolutionary organizational search
Authors: Boyang Li, Han Yu, Zhiqi Shen, Chunyan Miao
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

In this paper, we proposed Evolutionary Organizational Search (EOS), an optimization method for the organizational control of multi-agent systems (MASs) based on genetic programming (GP). EOS adds to the existing armory a metaheuristic extension, which is capable of efficient search and less vulnerable to stalling at local optima than greedy methods due to its stochastic nature. EOS employs a flexible genotype which can be applied to a wide range of tree-shaped organizational forms. EOS also considers special constraints of MASs. A novel mutation operator, the redistribution operator, was proposed. Experiments optimizing an information retrieval system illustrated the adaptation of solutions generated by EOS to environmental changes.
Benchmarking Fulltext Search Performance of RDF Stores
Authors: Enrico Minack, Wolf Siberski, Wolfgang Nejdl
Venue: Proceedings of the 6th European Semantic Web Conference on The Semantic Web: Research and Applications (2009)

More and more applications use the RDF framework as their data model and RDF stores to index and retrieve their data. Many of these applications require both structured queries as well as fulltext search. SPARQL addresses the first requirement in a standardized way, while fulltext search is provided by store-specific implementations. RDF benchmarks enable developers to compare structured query performance of different stores, but for fulltext search on RDF data no such benchmarks and comparisons exist so far. In this paper, we extend the LUBM benchmark with synthetic scalable fulltext data and corresponding queries for fulltext-related query performance evaluation. Based on the extended benchmark, we provide a detailed comparison of fulltext search features and performance of the most widely used RDF stores. Results show interesting RDF store insights for basic fulltext queries (classic IR queries) as well as hybrid queries (structured and fulltext queries). Our results are not only valuable for selecting the right RDF store for specific applications, but also reveal the need for performance improvements for certain kinds of queries.
An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints
Authors: P. Bonami, M. A. Lejeune
Venue: Operations Research (2009)

In this paper, we study extensions of the classical Markowitz mean-variance portfolio optimization model. First, we consider that the expected asset returns are stochastic by introducing a probabilistic constraint, which imposes that the expected return of the constructed portfolio must exceed a prescribed return threshold with a high confidence level. We study the deterministic equivalents of these models. In particular, we define under which types of probability distributions the deterministic equivalents are second-order cone programs and give closed-form formulations. Second, we account for real-world trading constraints (such as the need to diversify the investments in a number of industrial sectors, the nonprofitability of holding small positions, and the constraint of buying stocks by lots) modeled with integer variables. To solve the resulting problems, we propose an exact solution approach in which the uncertainty in the estimate of the expected returns and the integer trading restrictions are simultaneously considered. The proposed algorithmic approach rests on a nonlinear branch-and-bound algorithm that features two new branching rules. The first one is a static rule, called idiosyncratic risk branching, while the second one is dynamic and is called portfolio risk branching. The two branching rules are implemented and tested using the open-source <monospace>Bonmin</monospace> framework. The comparison of the computational results obtained with state-of-the-art MINLP solvers (<monospace>MINLP_BB</monospace> and <monospace>CPLEX</monospace>) and with our approach shows the effectiveness of the latter, which permits to solve to optimality problems with up to 200 assets in a reasonable amount of time. The practicality of the approach is illustrated through its use for the construction of four fund-of-funds now available on the major trading markets.
Congestion on the internet: operator responses, economic analysis, and improving the network architecture
Authors: David Clark
Venue:  (2008)

Our thesis presents the results of monitoring traffic management techniques of network providers. We find that in addition to complete blocking of traffic flows on some transport layer ports, providers are also actively managing traffic based upon application layer content. We document how providers are engaged in not just deep packet inspection, but deep flow inspection&mdash;tracking, shaping, and actively managing the state of individual flows. We explain why network operators attempt to manage traffic in these manners by looking at both the technical and economic forces influencing their decisions. We argue that inefficient congestion management and contractual practices of network providers are not unexpected given the limitations of the existing Internet architecture. Indeed, managing network traffic based upon transport and application layer content are likely to become more prevalent as high bandwidth demanding applications such as video and peer-to-peer increasingly dominate the traffic mix on networks. The existing Internet architecture leaves network operators with little architectural support for making more efficient traffic management decisions or contractual relationships. We therefore consider how making the architectural and protocol changes proposed by Briscoe et al. [14, 17, 16], might help better align the economic and technical interests of traffic senders and traffic carriers. Briscoe's proposal would enable traffic management and/or contractual relationships to be based directly on congestion information. Our contribution is to further the analysis of the economic implications of this proposal. We apply both game theory and elementary economic analysis to better understand the proposal's advantages and limitations. Aligning the congestion responses of end-users with the traffic management and contractual decisions of network operators is part of a larger challenge of designing the next generation Internet architecture and protocols while taking into account the economic interests of different stakeholders. Accepting a proposal such as Briscoe's requires the research and wider networking community to be able to balance both technical and economic arguments in a design process. We examine how this integration might occur. Establishing a means of discourse is vital to the objective evaluation of what constitutes good architecture and good research for these techno-economic problems. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Development of a Discussion Board System Designed for the Group Discussion that Includes Peer-Review Process
Authors: Shigeru Sasaki, Hiroyoshi Watanabe
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

In an advanced programming course, teachers can set tasks that students write unique program codes and reports. We included a peer-review process in the group discussion, in which students grade their friends programs and reports. Students can improve their programs and reports because they can compare and discuss their work with each other in the group discussion. However, because students write the graded points in their message in the peer-review process it has been taking a lot of work for teachers to total the points written in the messages. In this paper, we report a development of the discussion board system with some functions designed specially for the group discussion and its application in an advanced programming course.
Educational software packages for the One Laptop Per Child (OLPC) XO laptop
Authors: Michael Keating
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

The goal of the One Laptop Per Child program is "to provide children around the world with new opportunities to explore, experiment, and express themselves." To stay true to this vision, educational software packages must be engaging and interactive. However, due to the XO Laptop's modest system components, the software must be very efficient in utilizing the laptop's resources. This paper describes the One Laptop Per Child program, the XO Laptop, and the steps that need to be taken to successfully develop an educational program using Python and Pygame and port it to the XO.
Facial gesture analysis in an interactive environment
Authors: Gerard Medioni
Venue:  (2008)

This research focuses on tracking, modeling, quantifying and analyzing facial motions for gesture understanding. Facial gesture analysis is an important problem in computer vision since facial gestures carry signals besides words and are critical for nonverbal communication. The difficulty of automatic facial gesture recognition lies in the complexity of face motions. These motions can be categorized into two classes: global, rigid head motion, and local, nonrigid facial deformations. In reality, observed facial motions are a mixture of these two components. In this work, we propose a framework to take both of these two motions into account. The whole framework consists of three components: 3D head pose estimation, modeling local deformations, and expression classification. We propose a novel hybrid 3D head tracking algorithm to differentiate these two motions. The hybrid tracker integrates both intensity and feature correspondence information for robust real-time head pose estimation. Based on this tracker, we classify video segments into expressions by learning a graphical representation for nonrigid facial motions. The graphical model characterizes each face region by dense motion fields, and encodes inter-region dependencies in joint density functions. This graphical model is learned empirically using the EM algorithm and expression recognition is performed by Bayesian MAP estimation. In addition, rigid and nonrigid motions are analyzed simultaneously in 3D by manifold learning techniques. We decompose nonrigid facial deformations on a basis of 1D manifolds. Each 1D manifold is learned offline from sequences of labeled basic expressions, such as smile, surprise, etc. Any expression is then a linear combination of values along these axes, with coefficient representing the level of activation. We experimentally verify that expressions can indeed be represented this way, and that individual manifolds are indeed 1D. The manifold learning and dimensionality estimation are all implemented in the N-D Tensor Voting framework. The output of our system is a rich representation of the face, including the 3D pose, 3D shape, expression label with probability, and the activation level.
Rationality and the speed of decision-making
Authors: Michael Mandler
Venue: Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (2009)

We consider agents who choose by proceeding through an ordered list of criteria and give the lower bound on the number of criteria that are needed for an agent to make decisions that obey a given set of preference rankings. Agents with rational preferences can always use lists with the lower-bound number of criteria while any agent with nonrational preferences must on some domains use strictly more criteria. We preview some of the results in Mandler (2009) and explain in more detail the order-theoretic link between rationality and rapid decision-making.
Interactive 3D/2D visualization for geophysical data processing and interpretation
Authors: Igor Morozov, Glenn Chubak, Shannon Blyth
Venue: Computers Geosciences (2009)

A new 3D/2D interactive display server was developed for the IGeoS geophysical data processing framework presented earlier. With introduction of this major component, the framework becomes conceptually complete and potentially bridges the gap between traditional processing and interpretation geophysical software. The display server utilizes Qt toolkit and OpenGL graphics libraries while taking advantage of the object-oriented design of the core data processing system. It operates by creating image object trees that are automatically propagated to the server(s) residing on the same or remote hosts and producing complex, structured, and interactive data displays. The displays support custom interactive graphical user interfaces, which are constructed entirely by the user and do not require computer coding. With over 200 specialized processing tools available, this approach allows creating 3D visualizations and building custom interactive data analysis, interpretation, and modeling tools in many areas of application. In particular, we show examples of integration of seismic ray tracing, gravity, and receiver function modeling and inversion in deep crustal studies.
Courseware for teaching analytical reasoning principles: a hands-on laboratory
Authors: Jason O. Hallstrom, Joan Krone, Murali Sitaraman
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

The Collaborative Reasoning Paradigm offers a new approach to teaching analytical reasoning principles across the computer science curriculum. The paradigm relies on computer-assisted teaching tools and collaborative learning exercises designed to excite and engage students, while providing the foundation necessary to develop high-quality software. This workshop will introduce participants to some of the latest software tools and classroom exercises for teaching analytical reasoning principles at key points in the undergraduate curriculum. The workshop will follow a laboratory-style design, providing hands-on experience. The goal is to enable educators to inject new reasoning modules into their existing courses.