ppxscal/embedding_network huggingface dataset:
C/I gains in a single frequency network using TD-CDMA over a unicast network
Authors: Shin Horng Wong, Tim Wilkinson, Steve Stoker
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

This paper investigates the C/I gain of a Single Frequency Network for an MBSFN network using TDCDMA over an equivalent unicast network based on measurements from a trial network and simulations. It is shown that a cell edge C/I gain of 14.4 dB can be achieved in the trial network giving an increase of 59% in coverage by using a SFN over a unicast network.
A multigrain Delaunay mesh generation method for multicore SMT-based architectures
Authors: Christos D. Antonopoulos, Filip Blagojevic, Andrey N. Chernikov, Nikos P. Chrisochoides, Dimitrios S. Nikolopoulos
Venue: Journal of Parallel and Distributed Computing (2009)

Given the proliferation of layered, multicore- and SMT-based architectures, it is imperative to deploy and evaluate important, multi-level, scientific computing codes, such as meshing algorithms, on these systems. We focus on Parallel Constrained Delaunay Mesh (PCDM) generation. We exploit coarse-grain parallelism at the subdomain level, medium-grain at the cavity level and fine-grain at the element level. This multi-grain data parallel approach targets clusters built from commercially available SMTs and multicore processors. The exploitation of the coarser degree of granularity facilitates scalability both in terms of execution time and problem size on loosely-coupled clusters. The exploitation of medium-grain parallelism allows performance improvement at the single node level. Our experimental evaluation shows that the first generation of SMT cores is not capable of taking advantage of fine-grain parallelism in PCDM. Many of our experimental findings with PCDM extend to other adaptive and irregular multigrain parallel algorithms as well.
Multi-assignment clustering for Boolean data
Authors: Andreas P. Streich, Mario Frank, David Basin, Joachim M. Buhmann
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

Conventional clustering methods typically assume that each data item belongs to a single cluster. This assumption does not hold in general. In order to overcome this limitation, we propose a generative method for clustering vectorial data, where each object can be assigned to multiple clusters. Using a deterministic annealing scheme, our method decomposes the observed data into the contributions of individual clusters and infers their parameters. Experiments on synthetic Boolean data show that our method achieves higher accuracy in the source parameter estimation and superior cluster stability compared to state-of-the-art approaches. We also apply our method to an important problem in computer security known as role mining. Experiments on real-world access control data show performance gains in generalization to new employees against other multi-assignment methods. In challenging situations with high noise levels, our approach maintains its good performance, while alternative state-of-the-art techniques lack robustness.
A-Posteriori Error Estimates for Discontinuous Galerkin Approximations of Second Order Elliptic Problems
Authors: Carlo Lovadina, L. Donatella Marini
Venue: Journal of Scientific Computing (2009)

Using the weighted residual formulation we derive a-posteriori estimates for Discontinuous Galerkin approximations of second order elliptic problems in mixed form. We show that our approach allows to include in a unified way all the methods presented so far in the literature.
Credit Risk Assessment Model of Commercial Banks Based on Fuzzy Neural Network
Authors: Ping Yao, Chong Wu, Minghui Yao
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

A commercial bank credit risk assessment model based on fuzzy neural network has been established using the credit assessment index system established for commercial banks. This network is a 6 layered structure with 4 factor inputs and one output measuring the credit risk of commercial banks. The fuzzy rule layer has the capability of making necessary adjustments in accordance with specific conditions of problems. The operation of this model is much better than the totally black-box operation of a neural system. A substantiation analysis has been made with 167 observations as sample data; training results indicate that the network prediction has less error.
Origins of epistemics
Authors: Adam Brandenburger
Venue: Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (2009)

In 1935, Oskar Morgenstern wrote: [T]here is exhibited an endless chain of reciprocally conjectural reactions and counter-reactions. The remedy would lie in analogous employment of the so-called Russell theory of types in logistics. This would mean that on the basis of the assumed knowledge by the economic subjects of theoretical tenets of Type I, there can be formulated higher propositions of the theory; thus, at least, of Type II. On the basis of information about tenets of Type II, propositions of Type III, at least, may be set up, etc. We will attempt to trace, from this promising start, the steps forward and backward on the path to the development of epistemic game theory. This will take us through von Neumann and Morgenstern, Nash, and Harsanyi, to an emerging field of epistemics as of the mid-1980s. We will continue with some comments on the variety of epistemic frameworks in use today.
Direct manipulation of pictorial items within web sites: a drag & drop approach to on-line interaction
Authors: Mauro Mosconi, Marco Porta, Federico Zanetti
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

We present here a working prototypal Web site where a new approach for on-line interaction has been implemented and tested. Our intention is to improve the usability of Web sites (particularly e-commerce ones) by letting users directly interact with pictorial representations of objects (e.g. items on sale) in a way that resembles their behavior in real-world stores. Our discussion focuses both on the manifold usability benefits of the approach and on practical implementation issues.
General floorplans with L/T-shaped blocks using corner block list
Authors: Yu-Chun Ma, Xian-Long Hong, She-Qin Dong, C. K. Cheng, Jun Gu
Venue: Journal of Computer Science and Technology (2006)

With the recent advent of deep submicron technology and new packing schemes, the components in the integrated circuit are often not rectangular. On the basis of the representation of Corner Block List (CBL), we propose a new method of handling rectilinear blocks. In this paper, the handling of the rectilinear blocks is simplified by transforming the L/T-shaped block problem into the align-abutment constraint problem. We devise the block rejoining process and block alignment operation for forming the L/T-shaped blocks into their original configurations. The shape flexibility of the soft blocks, and the rotation and reflection of L/T-shaped blocks are exploited to obtain a tight packing. The empty rooms are introduced to the process of block rejoining. The efficiency and effectiveness of the proposed method are demonstrated by the experimental results on a set of some benchmark examples.
A quantitative Pólya's Theorem with zeros
Authors: Mari Castle, Victoria Powers, Bruce Reznick
Venue: Journal of Symbolic Computation (2009)

Let R[X]:=R[X"1,...,X"n]. Polya's Theorem says that if a form (homogeneous polynomial) p@?R[X] is positive on the standard n-simplex @D"n, then for sufficiently large N all the coefficients of (X"1+...+X"n)^Np are positive. The work in this paper is part of an ongoing project aiming to explain when Polya's Theorem holds for forms if the condition ''positive on @D"n'' is relaxed to ''nonnegative on @D"n'', and to give bounds on N. Schweighofer gave a condition which implies the conclusion of Polya's Theorem for polynomials f@?R[X]. We give a quantitative version of this result and use it to settle the case where a form p@?R[X] is positive on @D"n, apart from possibly having zeros at the corners of the simplex.
A Process for Driving Process Improvement in VSEs
Authors: Francisco J. Pino, Julio Ariel Hurtado Alegría, Juan Carlos Vidal, Félix García, Mario Piattini
Venue: Proceedings of the International Conference on Software Process: Trustworthy Software Development Processes (2009)

A success factor in Software Process Improvement -SPI- in very small enterprises -VSEs- is that improvement effort must be guided and managed by means of specific process. Nonetheless, many proposals related to this issue have not considered that type of process explicitly. So, aiming to establish SPI in VSEs systematically and coherently, we have defined a light process for managing and leading the improvement process step-by-step, called PmCOMPETISOFT. This paper introduces that process, which guides the implantation of an improvement cycle in an iterative and incremental manner. It also describes our experience of the application of the proposed process in four VSEs, through case studies. The results of the case studies show that the companies increased the capability of their processes, and that it is feasible to implement this process in this type of organizations, by investing an effort which corresponds to the particular characteristics of each.
A model for the dynamic coordination of multiple competing goals
Authors: Jose Antonio Martin H., Javier de Lope
Venue: Journal of Experimental Theoretical Artificial Intelligence (2009)

A general framework for the problem of coordination of multiple competing goals in dynamic environments for physical agents is presented. This approach to goal coordination is a novel tool to incorporate a deep coordination ability to pure reactive agents. The framework presented is based on the notion of multi-objective optimisation. In this article we propose a kind of 'aggregating functions' formulation with the particularity that the aggregation is weighted by means of a dynamic weighting unitary vector  [image omitted], which is dependent from the system dynamic state allowing the agent to dynamically coordinate the priorities of its single goals. This dynamic weighting unitary vector is represented as a (n-1) set of angles. The dynamic coordination must be established by means of a mapping between the state of the agent's environment S to the set of angles Φi(S) by means of any sort of machine-learning tool. In this work, we investigate the use of Reinforcement Learning as a first approach to learn that mapping.
Multi-sensor Optimal H ∞ Fusion Filters for a Class of Nonlinear Intelligent Systems with Time Delays
Authors: Meiqin Liu, Meikang Qiu, Senlin Zhang
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

This paper proposes a nonlinear system model, which is composed of a linear time-delay dynamic system and a bounded static nonlinear operator. Base on the H ∞ performance analysis of this nonlinear model, H ∞ fusion filter is designed for this model with multiple sensors to guarantee the asymptotic stability of the fusion error system and reduce the effect of the noise signals on the filtering error to a lowest level. The parameters of the filter are obtained by solving the eigenvalue problem (EVP). Some delayed (or non-delayed) intelligent systems composed of neural networks or Takagi and Sugeno (T-S) fuzzy models can be transformed into this nonlinear model, then the multi-sensor optimal H ∞ fusion filters for them are designed.
Concept of artificial neural network (ANN) and its application in cerebral aneurism with multi walls carbon nanotubes (MWCNT)
Authors: Rodica-Mariana Ion, Daniel Munteanu, George-Costel Cocina
Venue: Proceedings of the 10th WSEAS international conference on Neural networks (2009)

This paper describes the distinct properties of carbon nanotubes, and their use for biomedical applications. An innovative architecture for medical use of nanorobots are proposed as an advanced and precise tool for brain aneurysm instrumentation as nanorobots. The nanotubes include their nanometer diameter (∼0.4 nm to >3 nm (single walls carbon nanotubes - SWCNTs) and ∼1.4 nm to >100 nm (multi walls carbon nanotubes - MWNTs), length of several micrometers (up to centimeters), large aspect ratio (10-1000). The columnar structure of multi walls carbon nanotubes (MWCNT) is responsable for the special properties. In this paper, the controlled activity of MWCNT was studied at room temperature on dissociated cortical cultures from mice which supported a cerebral aneurism. Neurons and glial cells incubated for several days with this nanotube yielded to some connections between the islands are clearly apparent and interconnected networks are formed following the exact pattern of the MWCNT (nanotube) templates. The bridging consists either of an axon or bundles of axons and dendrites. Three days after incubation with MWCNT, show that cells first aggregate at the MWCNT islands. As they complete this step axons and dendrites begin to form and to build connections.
Bluetooth Tracking without Discoverability
Authors: Simon Hay, Robert Harle
Venue: Proceedings of the 4th International Symposium on Location and Context Awareness (2009)

Outdoor location-based services are now prevalent due to advances in mobile technology and GPS. Indoors, however, even coarse location remains unavailable. Bluetooth has been identified as a potential location technology that mobile consumer devices already support, easing deployment and maintenance. However, Bluetooth tracking systems to date have relied on the Bluetooth inquiry mode to constantly scan for devices. This process is very slow and can be a security and privacy risk. In this paper we investigate an alternative: connection-based tracking. This permits tracking of a previously identified handset within a field of fixed base stations. Proximity is determined by creating and monitoring low-level Bluetooth connections that do not require authorisation. We investigate the properties of the low-level connections both theoretically and in practice, and show how to construct a building-wide tracking system based on this technique. We conclude that the technique is a viable alternative to inquiry-based Bluetooth tracking.
Contractual traps
Authors: Ying-Ju Chen, Xiaojian Zhao
Venue: Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge (2009)

In numerous economic scenarios, contracting parties may not have a clear picture of all the relevant aspects. While confronted with these unawareness issues, the strategic decisions of the contracting parties critically depend on their sophistication. A contracting party may be unaware of what she is entitled to determine. Therefore, she can only infer some missing pieces via the contract offered by other parties and determine whether to accept the contract based on her own evaluation of how reasonable the contract is. Further, a contracting party may actively gather information and collect evidence about all possible contingencies to avoid to be trapped into the contractual agreement. In this paper, we propose a general framework to investigate these strategic interactions with unawareness, reasoning, and cognition. We build our conceptual framework upon the classical principal-agent relationship and compare the equilibrium behaviors under various degrees of the unaware agent's sophistication. Several implications regarding optimal contract design, possible exploitation, and cognitive thinking are also presented.
Polytopes in computational biology
Authors: Lior Pachter
Venue:  (2008)

In sequence alignment, and more generally in graphical models, finding the most likely explanation for observed data amounts to optimizing a linear functional c over an implicit set of lattice points S. Parametric inference asks for all most likely explanations as c varies, which means computing conv(S) and its normal fan. Applications make further demands upon parametric inference. Often only an envelope of conv(S) needs to be computed. We might also want to compute the k-best points in S as c varies&mdash;which means computing all ordered k-sets. We call this parametric k-best inference. Given a point set S, we develop a theory of k-ordertopes, whose vertices correspond to ordered k-sets in S. We relate k-ordertopes to previously studied k-set polytopes. For S &sub; Zd , stark bounds on the number of k-sets and ordered k-sets are obtained, which give a simple proof of Barany's result that Andrews' O( Vd-1 /d+1 ) bound on the number of vertices of a lattice polytope of volume V extends to all faces. We present the software iB4e, which computes conv( S) given an oracle which optimizes functionals over S. iB4e can perform parametric k-best inference, compute Minkowski sums, Gr&ouml;bner fans, integer hulls, Newton polytopes, and A-envelopes of implicitly defined polytopes. For fixed k, the number of oracle calls iB4e uses for parametric k-best alignment matches the best known bounds for parametric alignment. A whole-genome parametric alignment of Drosophila obtained by iB4e is presented. Finally, we analyze neighbor-joining (NJ) and balanced minimum evolution (BME) methods for phylogenetic reconstruction. The fibers of both NJ and BME partition the space of dissimilarity maps into a polyhedral subdivision. For small n we compute and study the refinement of NJ/BME subdivisions of R&parl0;n2 &parr0; , which completely characterizes NJ's performance as a greedy heuristic for BME.
A nanoanalytical investigation of the Ga2O3/GaGdO dielectric gate stack for InGaAs based MOSFET devices
Authors: P. Longo, G. W. Paterson, M. C. Holland, I. G. Thayne, A. J. Craven
Venue: Microelectronic Engineering (2009)

In this paper, a subnanometer characterization of the Ga"2O"3/GdGaO dielectric gate stack grown on top of InGaAs lattice matched to n^+ InP substrate is presented. The paper shows the analysis of two samples grown using different substrate temperature. This clearly affects the electrical characteristics as well as the photoluminescence properties. The paper also describes how the growth conditions of oxide stack affect the elemental distribution across the interface region.
Simultaneous minimization of capacity and conflict misses
Authors: Zhiyuan Li
Venue: Journal of Computer Science and Technology (2007)

Loop tiling (or loop blocking) is a well-known loop transformation to improve temporal locality in nested loops which perform matrix computations. When targeting caches that have low associativities, one of the key challenges for loop tiling is to simultaneously minimize capacity misses and conflict misses. This paper analyzes the effect of the tile size and the array-dimension size on capacity misses and conflict misses. The analysis supports the approach of combining tile-size selection (to minimize capacity misses) with array padding (to minimize conflict misses).
Realizing Adaptive Questions and Answers for ICALL Systems
Authors: Hidenobu Kunichika, Minoru Urushima, Tsukasa Hirashima, Akira Takeuchi
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

Language training systems that provide learners adaptive questions on the contents of stories require several capabilities such as semantic analysis, automated question generation and diagnosis of learners' answer sentences. This paper presents a method of selecting questions from a generated list to realize adaptive questions and answers. Our method filters out similar questions, and then selects questions by considering the difficulty, types and order. This paper also describes an evaluation of our method. As the result of our experiment demonstrates, we have found that our method generates a viable series of questions.
Fine arts perspective in user interface design
Authors: Can Kültür, Ilgim Veryeri Alaca
Venue: ACM SIGCSE Bulletin (2009)

In this poster, we first aim to explain an interdisciplinary approach and question an idea and attempt. Second, we aim to underline challenges and enablers of such an attempt. This idea can be briefly summarized as "inclusion of learning activities and assessments that are applied in coordination with the Department of Fine Arts might be necessary in terms of developing visual design skills". The target of this approach is improving the courses like 'human computer interaction' or 'user-interface design'.
How to teach programming in secondary education: first results of a PhD project
Authors: Mara Saeli
Venue: ACM SIGCSE Bulletin (2009)

In this paper a first introduction to the concept of Pedagogical Content Knowledge (PCK) of Programming for secondary school is given. PCK is the knowledge of why a subject should be taught, how that subject should be taught, what topics of that subject should be taught and for whom the teaching of the topic is meant. Moreover a method to uncover the PCK of Programming is described.
E-Learning and Organisational Change: A Change Management Case Study
Authors: Ray Webster
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

This paper considers e-learning and information systems driven organisational change in higher education. It provides a case study of an attempt to use IT and an e-learning strategy to add value to an organisation and prepare it for participation in a networked society. It is also a case study of systems failure in terms of the implementation of the e-learning strategy. A case study of events at a UK university based on interviews with a range of managers and change agents and two subsequent quality agency reports are used to illustrate these considerations. Dill's categories of design elements for promoting change in higher education institutions are then used as a framework to comparison.
Mapping the Presidential Election Cycle in US stock markets
Authors: Wing-Keung Wong, Michael McAleer
Venue: Mathematics and Computers in Simulation (2009)

This paper shows that in the almost four decades from January 1965 through to December 2003, US stock prices closely followed the 4-year Presidential Election Cycle. In general, stock prices fell during the first half of a Presidency, reached a trough in the second year, rose during the second half of a Presidency, and reached a peak in the third or fourth year. This cyclical trend is found to hold for the greater part of the last ten administrations, starting from President Lyndon Johnson to the administration of President George W. Bush, particularly when the incumbent is a Republican. The empirical results suggest that the Republican Party may have greater cause to engage in active policy manipulation to win re-election than their Democratic counterparts. There is irony in that bullish runs in the stock market have tended to coincide with sub-periods under Democratic administrations. The existence of the Presidential Election Cycle shown in the paper may constitute an anomaly in the US stock market, which could be useful for investors.
Monte Carlo and Quasi-Monte Carlo Methods 2006, 1st edition
Authors: Alexander Keller, Stefan Heinrich, Harald Niederreiter
Venue:  (2007)

This book represents the refereed proceedings of the Seventh International Conference on Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing, held in Ulm (Germany) in August 2006. The proceedings include carefully selected papers on many aspects of Monte Carlo and quasi-Monte Carlo methods and their applications, as well as providing information on current research in these very active areas. Besides covering theory, the book is an excellent resource work for practitioners as well.