ppxscal/embedding_network huggingface dataset:
Graphene nanoribbon FETs: technology exploration and CAD
Authors: Kartik Mohanram, Jing Guo
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Graphene nanoribbon FETs (GNRFETs) have emerged as a promising candidate for nanoelectronics applications. This paper summarizes (i) current understanding and prospects for GNRFETs as ultimately scaled, ideal ballistic transistors, (ii) physics-based modeling of GNRFETs to support circuit design and CAD, and (iii) variability and defects in GNRs and their impact on GNRFET circuit performance and reliability.
An Improved Reversible Difference Expansion Watermarking Algorithm
Authors: Sachnev Vasiliy, Hyoung-Joong Kim, Shijun Xiang, Jeho Nam
Venue: Proceedings of the 6th International Workshop on Digital Watermarking (2008)

In this paper, we propose an improved reversible watermarking algorithm by using the simplified location map. The proposed embedding method is based on the Alattar integer transform [3]. Here, we extend the case of using four pixels. Proposed simplified location map we propose just covers those necessary quads, the improved watermarking algorithm has a larger embedding capacity in comparison with the work of Alattar[3]. Simulation testing shows that our embedding strategy has achieved a better performance for all tested images.
An Agent-Based Trust Model for Service-Oriented Systems
Authors: Manling Zhu, Zhi Jin
Venue: Trust in Agent Societies: 11th International Workshop, TRUST 2008, Estoril, Portugal, May 12 -13, 2008. Revised Selected and Invited Papers (2008)

In this paper, we propose an agent-based trust modeling architecture for service-oriented computing. A Trust Ontology is built to offer better understanding to the trust relationships in service-oriented systems. Based on this ontology, algorithms have been given for supporting trust analysis, reasoning and computing. Finally a case study is presented to illustrate how this formalism of service trust framework can be used. We argue that our trust model can assist service agents to make rational trading decisions by measuring the trustworthiness of the potential partners.
The VALI (Variable Language Interpreter)
Authors: James D. Mooney
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

The Variable Language Interpreter (VALI) is a high-level-language computer architecture. The language definition is not fixed, but can be easily changed to process many popular languages. The languages may be complete, so portable programs can be handled. VALI makes use of parallel processors to achieve its objectives. Parsing is carried out by an array of identical units called token processors. These generate a high-level intermediate form called an execution tree. This tree is then interpreted by additional processors, exploiting its parallelism whenever possible. A version of this design has been simulated. Suitable implementation methods are discussed.
Immersive authoring of Tangible Augmented Reality content: A user study
Authors: Gun A. Lee, Gerard J. Kim
Venue: Journal of Visual Languages and Computing (2009)

Immersive authoring refers to the style of programming or developing content from within the targetexecutable environment. Immersive authoring is important for fields such as augmented reality (AR) in which interaction usability and user perception of the target content must be checked first hand, in situ. In addition, the interaction efficiency and usability of the authoring tools itself is equally important forease of authoring. In this paper, we propose design principles and describe an implementation of animmersive authoring system for AR. More importantly, we present a formal user study demonstrating its benefits and weaknesses. In particular, our results demonstrate that, compared to using the traditional 2D desktop development method, immersive authoring gained significant efficiency in specifying spatial arrangements and behavior tasks, a major component of AR content authoring. However, it was not so successful for abstract tasks such as logical programming. Based on this result, we suggest that a comprehensive AR authoring tool should include such immersive authoring functionality to help, particularly non-technical media artists, create effective contents based on the characteristics of the underlying media and interaction style.
A multivariate time series approach to modeling and forecasting demand in the emergency department
Authors: Spencer S. Jones, R. Scott Evans, Todd L. Allen, Alun Thomas, Peter J. Haug, Shari J. Welch, Gregory L. Snow
Venue: Journal of Biomedical Informatics (2009)

Study objective: The goals of this investigation were to study the temporal relationships between the demands for key resources in the emergency department (ED) and the inpatient hospital, and to develop multivariate forecasting models. Methods: Hourly data were collected from three diverse hospitals for the year 2006. Descriptive analysis and model fitting were carried out using graphical and multivariate time series methods. Multivariate models were compared to a univariate benchmark model in terms of their ability to provide out-of-sample forecasts of ED census and the demands for diagnostic resources. Results: Descriptive analyses revealed little temporal interaction between the demand for inpatient resources and the demand for ED resources at the facilities considered. Multivariate models provided more accurate forecasts of ED census and of the demands for diagnostic resources. Conclusion: Our results suggest that multivariate time series models can be used to reliably forecast ED patient census; however, forecasts of the demands for diagnostic resources were not sufficiently reliable to be useful in the clinical setting.
Extended Statistical Landscape Features for Texture Retrieval
Authors: Lei Qin, Guo Zhi-Cheng
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 03 (2009)

Texture analysis is an important research area in computer vision and pattern recognition. This paper proposes a method of Extended Statistical Landscape Features (ESLF), based on the Statistical Landscape Features method. Extended Statistical Landscape Features represents an image function as a surface in a three-dimensional space, which is sliced by a variable horizontal plane. Four texture feature curves describing their topological properties are extracted from the three-dimensional surface. The proposed Extended Statistical Landscape Features uses the derived feature curves to characterize image texture. Systematic experimental comparison on the Brodatz texture set as well as the VisTex texture set shows that the retrieval performance and time efficiency of the proposed Extended Statistical Landscape Features are higher than Statistical Landscape Features, which demonstrates that the proposed method have a very high texture description power.
Predicting Project Velocity in XP Using a Learning Dynamic Bayesian Network Model
Authors: Peter Hearty, Norman Fenton, David Marquez, Martin Neil
Venue: IEEE Transactions on Software Engineering (2009)

Bayesian networks, which can combine sparse data, prior assumptions and expert judgment into a single causal model, have already been used to build software effort prediction models. We present such a model of an Extreme Programming environment and show how it can learn from project data in order to make quantitative effort predictions and risk assessments without requiring any additional metrics collection program. The model's predictions are validated against a real world industrial project, with which they are in good agreement.
Intracortical wireless microsystems for biosensing and neurostimulation
Authors: Mohamad Sawan
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

This tutorial covers circuits and systems techniques for the integration and packaging of implantable biosensing and neurostimulation devices. Such Microsystems, dedicated for interconnections to intracortical neural tissues, are wirelessly powered up while bidirectional data are exchanged between them and external controllers. Global view of main devices will be described, case studies related to massively parallel recording of neural signals will be shown, and special attention will be paid to monitoring and microstimulation in the primary visual cortex through an optimized number of electrode arrays and power management of these bioelectronic devices.
Supporting the Dynamic Reprioritization of Requirements in Agile Development of Software Products
Authors: Zornitza Racheva, Maya Daneva, Luigi Buglione
Venue: Proceedings of the 2008 Second International Workshop on Software Product Management (2008)

of choice for many software producers whose realities include highly uncertain requirements, use of new development technology, and clients willing to explore the ways in which an evolving product can help their business goals. From customer's perspective, the activity of continuous requirements reprioritization forms the very core of today's agile approaches. However, the freedom for clients to do so does not come for free. This paper presents results of a literature review on agile requirements prioritization methods, derives a conceptual model for understanding the inter-iteration prioritization process in terms of inputs and outcomes, and identifies issues and solutions pertinent to agile prioritization The latter are derived from the authors' experiences and by using empirical data, published earlier by other authors. Keywords: agile development, requirements prioritization, inter-iteration decision-making process.
Accessibility commons: a metadata repository for web accessibility
Authors: Shinya Kawanaka, Masatomo Kobayashi, Hironobu Takagi, Chieko Asakawa
Venue: Issue Summer (June 2009) (2009)

Metadata plays a crucial role for creating a more accessible Web environment, spanning from simple alternative texts for images to various types of UI widgets used in dynamic content. Beyond the current accessibility improvement methods that rely on inlined metadata embedded by the developers, various active research projects are focusing on external metadata which is the key to improve even existing content without touching the original code, so Web accessibility can be more flexible and adaptive to various user needs. Accessibility Commons is a new proposal to build a standardized shared repository for externalized metadata. It was initially proposed by IBM and three universities last year, and then proved its applicability through the Social Accessibility project. Now is the time to move beyond single-system-implementation to a federated data infrastructure for a wide range of Web accessibility research activities and a more adaptive Web environment for people throughout the world. After introducing the basic ideas, research projects, and technical challenges, we will discuss future directions, the potential, and broader applications.
Investigating the behaviour of a discrete retrial system
Authors: Péter Kárász
Venue: Acta Cybernetica (2008)

Certain technological applications use queuing systems where the service time of entering entities cannot take any value, it can only be a multiple of a certain cycle-time. As examples of this, one can mention the landing of aeroplanes and the optical buffers of internet networks. Servicing an entering customer can be started immediately, or, if the server is busy, or there are waiting customers, the new customer joins a queue, moving along a closed path which can be completed within a fixed cycle-time of T units. Applications in digital technology induce the investigation of discrete systems. We give the mathematical description of systems serving two types of customers, where inter-arrival times follow a geometric distribution, and service times are distributed uniformly. A Markov-chain is defined and the generating functions of transition probabilities are calculated. The condition of ergodicity is established and the equilibrium distribution is given.
Cholesky decomposition using fused datapath synthesis
Authors: Suleyman S. Demirsoy, Martin Langhammer
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

In this paper we present an implementation of a Cholesky decomposition core, with IEEE754 single precision arithmetic. The datapaths are generated using fused datapath synthesis, created with an experimental floating point compiler tool, capable of fitting hundreds of floating point operators into a single device. We present a scalable architecture for both real and complex matrixes, on which we will report results for up to 128x128 real matrices. The concepts of fused datapath synthesis for FPGA floating point designs will be reviewed, and the application to the Cholesky algorithm detailed. Experimental results will be given to show that the accuracy of this method is superior to those expected from a traditional IEEE754 core based design flow.
Update on economic approach to simulation selection problems
Authors: Stephen E. Chick, Noah Gans
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper summarizes new analytical and empirical results for the economic approach to simulation selection problems that we introduced two years ago. The approach seeks to help managers to maximize the expected net present value (NPV) of system design decisions that are informed by simulation. It considers the time value of money, the cost of simulation sampling, and the time and cost of developing simulation tools. This economic approach to decision making with simulation is therefore an alternative to the statistical guarantees or probabilistic convergence results of other commonly-used approaches to simulation optimization. Empirical results are promising. This paper also retracts a claim that was made regarding the existence of Gittins' indices for these problems -- their existence remains an open question.
Taxing Subnetworks
Authors: Martin Hoefer, Lars Olbrich, Alexander Skopalik
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We study taxes in the well-known game theoretic traffic model due to Wardrop. Given a network and a subset of edges, on which we can impose taxes, the problem is to find taxes inducing an equilibrium flow of minimal network-wide latency cost. If all edges are taxable, then marginal cost pricing is known to induce the socially optimal flow for arbitrary multi-commodity networks. In contrast, if only a strict subset of edges is taxable, we show NP-hardness of finding optimal taxes for general networks with linear latency functions and two commodities. On the positive side, for single-commodity networks with parallel links and linear latency function, we provide a polynomial time algorithm for finding optimal taxes.
A geometric analysis of Renegar&#x2019;s condition number, and its interplay with conic curvature
Authors: Alexandre Belloni, Robert M. Freund
Venue: Mathematical Programming: Series A and B (2009)

For a conic linear system of the form Ax &#x2208;K, K a convex cone, several condition measures have been extensively studied in the last dozen years. Among these, Renegar&#x2019;s condition number $${\mathcal{C}}(A)$$is arguably the most prominent for its relation to data perturbation, error bounds, problem geometry, and computational complexity of algorithms. Nonetheless, $${\mathcal{C}}(A)$$is a representation-dependent measure which is usually difficult to interpret and may lead to overly conservative bounds of computational complexity and/or geometric quantities associated with the set of feasible solutions. Herein we show that Renegar&#x2019;s condition number is bounded from above and below by certain purely geometric quantities associated with A and K; furthermore our bounds highlight the role of the singular values of A and their relationship with the condition number. Moreover, by using the notion of conic curvature, we show how Renegar&#x2019;s condition number can be used to provide both lower and upper bounds on the width of the set of feasible solutions. This complements the literature where only lower bounds have heretofore been developed.
Node and edge selectivity estimation for range queries in spatial networks
Authors: E. Tiakas, A. N. Papadopoulos, A. Nanopoulos, Y. Manolopoulos
Venue: Information Systems (2009)

Modern applications requiring spatial network processing pose several interesting query optimization challenges. Spatial networks are usually represented as graphs, and therefore, queries involving a spatial network can be executed by using the corresponding graph representation. This means that the cost for executing a query is determined by graph properties such as the graph order and size (i.e., number of nodes and edges) and other graph parameters. In this paper, we present novel methods to estimate the number of nodes and edges in regions of interest in spatial networks, towards predicting the space and time requirements for range queries. The methods are evaluated by using real-life and synthetic data sets. Experimental results show that the number of nodes and edges can be estimated efficiently and accurately, with relatively small space requirements, thus providing useful information to the query optimizer.
Multimodal Integration in the Muesli Project
Authors: Gavin E. Churcher, Peter J. Wyard
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

The rapid acceptance of the World Wide Web (WWW) has led to a lot of interest in the use of online shopping or e-commerce. This is driving forward new interface designs which offer a more natural and human-like interaction. MUeSLI is a system which allows a user to browse through fabrics and apply them to a virtual sitting room by talking to a synthetic persona and touching objects and fabrics in the room. This paper outlines the programme and progress of the MUeSLI project currently being undertaken at BT Laboratories. The main focus of the project is the integration of two or more modes of interaction within a real-world application. The application has been through a number of iterations: a focus group, Wizard of Oz trials and is currently being developed into a fully automatic system. The development of the architecture has highlighted the complexities surrounding the interpretation of more than one mode, and a number of pertinent issues are discussed. Further trials, eventually using members of the public, will allow us to investigate the effective design of robust interfaces.
Speeding up AdaBoost Classifier with Random Projection
Authors: Biswajit Paul, G. Athithan, M. Narasimha Murty
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

The development of techniques for scaling up classifiers so that they can be applied to problems with large datasets of training examples is one of the objectives of data mining. Recently, AdaBoost has become popular among machine learning community thanks to its promising results across a variety of applications. However, training AdaBoost on large datasets is a major problem, especially when the dimensionality of the data is very high. This paper discusses the effect of high dimensionality on the training process of AdaBoost. Two preprocessing options to reduce dimensionality, namely the principal component analysis and random projection are briefly examined. Random projection subject to a probabilistic length preserving transformation is explored further as a computationally light preprocessing step. The experimental results obtained demonstrate the effectiveness of the proposed training process for handling high dimensional large datasets.
Anime de Blog: animation CGM for content distribution
Authors: Kaoru Sumi
Venue: Proceedings of the 2008 International Conference on Advances in Computer Entertainment Technology (2008)

Anime de Blog is an animation consumer generated media (CGM) by which we can create blogs with animation content; the system can collect 3D animation and image data. The animations or image data are searched for and selected from shared consumer-generated databases by using simple words. If users cannot find appropriate data, they can easily create new data by using the provided animation editor and upload it by entering related words. Our animation database, Animebase, correlates natural language with three-dimensional animation data. When an animation is uploaded, the system applies the motion data of this model to other models and generates new animations, which are then stored in Animebase. Anime de Blog has been put up on the Web as a test installation. This paper describes the system and a follow-up report of the test installation.
Reengineering for service oriented architectures: A strategic decision model for integration versus migration
Authors: Amjad Umar, Adalberto Zordan
Venue: Journal of Systems and Software (2009)

Service Oriented Architecture (SOA) is a popular paradigm at present because it provides a standards-based conceptual framework for flexible and adaptable enterprise wide systems. This implies that most present systems need to be reengineered to become SOA compliant. However, SOA reengineering projects raise serious strategic as well as technical questions that require management oversight. This paper, based on practical experience with SOA projects, presents a decision model for SOA reengineering projects that combines strategic and technical factors with cost-benefit analysis for integration versus migration decisions. The paper identifies the key issues that need to be addressed in enterprise application reengineering projects for SOA, examines the strategic alternatives, explains how the alternatives can be evaluated based on architectural and cost-benefit considerations and illustrates the main ideas through a detailed case study.
A Recommender System Based on Local Random Walks and Spectral Methods
Authors: Zeinab Abbassi, Vahab S. Mirrokni
Venue: Advances in Web Mining and Web Usage Analysis: 9th International Workshop on Knowledge Discovery on the Web, WebKDD 2007, and 1st International Workshop on Social Networks Analysis, SNA-KDD 2007, San Jose, CA, USA, August 12-15, 2007. Revised Papers (2009)

In this paper, we design recommender systems for blogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, we observe the use of the personalized page rank vector to capture the relevance among nodes in a social network. We apply the local partitioning algorithms based on refined random walks to approximate the personalized page rank vector, and extend these ideas from undirected graphs to directed graphs. Moreover, inspired by ideas from spectral clustering, we design a similarity metric among nodes of a social network using the eigenvalues and eigenvectors of a normalized adjacency matrix of the social network graph. In order to evaluate these algorithms, we crawled a set of blogs and construct a blog graph. We expect that these algorithms based on the link structure perform very well for blogs, since the average degree of nodes in the blog graph is large. Finally, we compare the performance of our algorithms on this data set. In particular, the acceptable performance of our algorithms on this data set justifies the use of a link-based recommender system for social networks with large average degree.