ppxscal/embedding_network huggingface dataset:
A Spatial Structural and Statistical Approach to Building Classification of Residential Function for City-Scale Impact Assessment Studies
Authors: Dimitrios P. Triantakonstantis, Stuart L. Barr
Venue: Proceedings of the International Conference on Computational Science and Its Applications: Part I (2009)

In order to implement robust climate change adaption and mitigation strategies in cities fine spatial scale information on building stock is required. However, for many cities such information is rarely available. In response, we present a methodology that allows topographic building footprints to be classified to the level of residential spatial topological-building types and corresponding period of construction. The approach developed employs spatial structure and topology to first recognise residential spatial topological types of Detached, Semi-Detached or Terrace. Thereafter, morphological and spatial metrics are employed with multinomial logistic regression to assign buildings to particular periods of construction for use within city-scale impact assessment studies. Overall the system developed performs well for the classification of residential building exemplars for the city of Manchester UK, with an overall accuracy of 83.4%, although with less satisfactory results for the Detached period of construction (76.6%) but excellent accuracies for the Semi-Detached residential buildings (93.0%).
Analyzing the Localization of Retail Stores with Complex Systems Tools
Authors: Pablo Jensen
Venue: Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII (2009)

Measuring the spatial distribution of locations of many entities (trees, atoms, economic activities, ...), and, more precisely, the deviations from purely random configurations, is a powerful method to unravel their underlying interactions. I study here the spatial organization of retail commercial activities. From pure location data, network analysis leads to a community structure that closely follows the commercial classification of the US Department of Labor. The interaction network allows to build a 'quality' index of optimal location niches for stores, which has been empirically tested. 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
Implementing a Brokered Notification System for Grid Middleware
Authors: Andrei Mihut, Horia Ciocirlie
Venue: Proceedings of the 2008 10th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2008)

In this paper we describe an implementation of a brokered notification system that can be integrated in Globus Toolkit 4 (GT4). This system is designed as a grid service based on publish/subscribe paradigm. The implementation of this system is trying to meet the requirements imposed by the WS-BrokeredNotification specification. We try to build an Internet scale notification system for grid networks, which use GT4 middleware. We start from the requests imposed by such a system and we show how to design and implement such a system. The system can be integrated into GT4 distributions.
Multimodal effects of local context on target detection: Evidence from p3b
Authors: Noa Fogelson, Xue Wang, Jeffrey B. Lewis, Mark M. Kishiyama, Mingzhou Ding, Robert T. Knight
Venue: Journal of Cognitive Neuroscience (2009)

We used the P300 component to investigate how changes in local context influenced the ability to detect target stimuli. Local context was defined as the occurrence of a short predictive series of stimuli before delivery of a target event. EEG was recorded in 12 subjects during auditory and visual sessions. Stimuli were presented in the center of the auditory and visual field and consisted of 15% targets (1000 Hz tone or downward facing triangle) and 85% of equal amounts of three types of standards (1500, 2000, and 2500 Hz tones or triangles facing left, upward, and right). Recording blocks consisted of targets preceded by either randomized sequences of standards or by sequences including a three-standard predictive sequence signaling the occurrence of a subsequent target event. Subjects pressed a button in response to targets. Peak target P300 (P3b) amplitude and latency were evaluated for targets after predictive and nonpredictive sequences using conventional averaging and a novel single-trial analysis procedure. Reaction times were shorter for predictable targets than for nonpredicted targets. P3b latency was shorter for predicted targets than for nonpredictive targets, and there were no significant P3b amplitude differences between predicted and random targets, as determined by both conventional averaging and single-trial analysis. Comparable effects on amplitude and latency were observed in both the auditory and visual modalities. The results indicate that local context has differential effects on P3b amplitude and latency, and exerts modality-independent effects on cognitive processing.
Testing ±1-weight halfspace
Authors: Kevin Matulef, Ryan O'Donnell, Ronitt Rubinfeld, Rocco A. Servedio
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

We consider the problem of testing whether a Boolean function f:{ - 1,1} n -->{ - 1,1} is a ±1-weight halfspace, i.e. a function of the form f(x) = sgn(w 1 x 1 + w 2 x 2 + ... + w n x n ) where the weights w i take values in { - 1,1}. We show that the complexity of this problem is markedly different from the problem of testing whether f is a general halfspace with arbitrary weights. While the latter can be done with a number of queries that is independent of n [7], to distinguish whether f is a ±-weight halfspace versus ε-far from all such halfspaces we prove that nonadaptive algorithms must make Ω(logn) queries. We complement this lower bound with a sublinear upper bound showing that $O(\sqrt{n}\cdot $poly$(\frac{1}{\epsilon}))$ queries suffice.
3D Body Scanning's Contribution to the Use of Apparel as an Identity Construction Tool
Authors: Marie-Eve Faust, Serge Carrier
Venue: Proceedings of the 2nd International Conference on Digital Human Modeling: Held as Part of HCI International 2009 (2009)

Humans use apparel as an artifact to construct their identities and present it to the outside world. Beyond textiles and clothing style, garment fit contributes to this image presentation. This research, conducted on the Hong Kong market shows that women view 3D body scanning technology positively and that it therefore could prove an effective and efficient tool, both from a consumer's and from a seller's point of view, in facilitating the body image creation.
What DNS is not
Authors: Paul Vixie
Venue: Communications of the ACM (2009)

DNS is many things to many people---perhaps too many things to too many people.
Voltage Transfer Characteristic Analysis of Matrix Converter
Authors: Hao Cai, Yue Cai, Xiaoying Li
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 02 (2009)

An over modulation strategy for matrix converter (MC) is put forward on the basis of conventional AC/DC/AC MC control theory. At first, fictitious AC/DC rectifier is over modulated to get the greatest dummy DC voltage, then fictitious DC/AC inverter is modulated from linear region to six-step modes seamlessly, which effectively improve the voltage utilization. Voltage transfer ratio under different conditions is emphatically analyzed with Fourier transform. Finally, different modulation method is simulated with MATLAB. Both math analyses and simulation results verify that the over modulation strategy is very useful to improve voltage utilization, which provide a theoretical basis for further research.
Sound Equalization Tips and Tricks
Authors: Eddie Bazil
Venue:  (2009)

* Clear easy to understand explanations * Diagrams, graphs and charts * All types of EQs and processes used * Before and after audio examples * EQ treatment for drums, voice and the mix * Audio files available for download Sound Equalization Tips and Tricks is a clear, concise and detailed guide for all aspects of equalisation. Written in laymen s terms, this book contains detailed explanations for all types of EQ, what they are used for, when they are to be used, why and how to use them. From beginner to advanced, this book journeys through the concept of sound, the understanding of frequencies and the application of EQ, in such clear detail that all can benefit. Throughout the book, before and after audio and visual examples are provided, from actual processing projects, to help you to clearly and simply understand the content both visually and aurally. Broken into definition and explanation chapters, followed by working case examples , the book s content is clearly laid out for easy referencing. If you have been struggling with the concept of EQ, both in terms of understanding what it is and in terms of application, then this book will demystify this cloaked dynamic and offer you a simple working structure to help you master EQ. 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
Multiclass Microarray Gene Expression Analysis Based on Mutual Dependency Models
Authors: Girija Chetty, Madhu Chetty
Venue: Proceedings of the 4th IAPR International Conference on Pattern Recognition in Bioinformatics (2009)

In this paper a novel feature selection technique based on mutual dependency modelling between genes is proposed for multiclass microarray gene expression classification. Several studies on analysis of gene expression data has shown that the genes (whether or not they belong to the same gene group) get co-expressed via a variety of pathways. Further, a gene may participate in multiple pathways that may or may not be co-active for all samples. It is therefore biologically meaningful to simultaneously divide genes into functional groups and samples into co-active categories. This can be done by modeling gene profiles for multiclass microarray gene data sets based on mutual dependency models, which model complex gene interactions. Most of the current works in multiclass microarray gene expression studies are based on statistical models with little or no consideration of gene interactions. This has led to lack of robustness and overly optimistic estimates of accuracy and noise reduction. In this paper, we propose multivariate analysis techniques which model the mutual dependency between the features and take into account complex interactions for extracting a subset of genes. The two techniques, the cross modal factor analysis (CFA) and canonical correlation analysis(CCA) show a significant reduction in dimensionality and class-prediction error, and improvement in classification accuracy for multiclass microarray gene expression datasets.
Mesh algorithms for PDE with Sieve I: Mesh distribution
Authors: Matthew G. Knepley, Dmitry A. Karpeev
Venue: Scientific Programming (2009)

We have developed a new programming framework, called Sieve, to support parallel numerical partial differential equation(s) (PDE) algorithms operating over distributed meshes. We have also developed a reference implementation of Sieve in C++ as a library of generic algorithms operating on distributed containers conforming to the Sieve interface. Sieve makes instances of the incidence relation, or arrows, the conceptual first-class objects represented in the containers. Further, generic algorithms acting on this arrow container are systematically used to provide natural geometric operations on the topology and also, through duality, on the data. Finally, coverings and duality are used to encode not only individual meshes, but all types of hierarchies underlying PDE data structures, including multigrid and mesh partitions. In order to demonstrate the usefulness of the framework, we show how the mesh partition data can be represented and manipulated using the same fundamental mechanisms used to represent meshes. We present the complete description of an algorithm to encode a mesh partition and then distribute a mesh, which is independent of the mesh dimension, element shape, or embedding. Moreover, data associated with the mesh can be similarly distributed with exactly the same algorithm. The use of a high level of abstraction within the Sieve leads to several benefits in terms of code reuse, simplicity, and extensibility. We discuss these benefits and compare our approach to other existing mesh libraries.
User Profiling and Re-identification: Case of University-Wide Network Analysis
Authors: Marek Kumpošt, Vašek Matyáš
Venue: Proceedings of the 6th International Conference on Trust, Privacy and Security in Digital Business (2009)

In this paper we present our methodology for context information processing, modeling users' behaviour and re-identification. Our primary interest is to what extent a user can be re-identified if we have his "user profile" and how much information is required for a successful re-identification. We operate with "user profiles" that reflect user's behaviour in the past. We describe the input date we use for building behavioural characteristics; similarity searching procedure and an evaluation of the re-identification process. We discuss (and provide results of our experiments) how different initial conditions, as well as different approaches used in the similarity searching phase, influence the results and propose the optimal scenario where we obtain the most accurate results. We provide experimental results of re-identification of three protocols (SSH, HTTP and HTTPS).
Genetic algorithms to solve the power system restoration planning problem
Authors: Adelmo L. Cechin, Jos&#x00e9; V. Canto dos Santos, Carlos A. Mendel, Arthur T. G&#x00f3;mez
Venue: Engineering with Computers (2009)

This study reports the use of a Genetic Algorithm (GA) to solve the Power System Restoration Planning Problem (PSRP). The solution to the PSRP is described by a series of operations or a plan to be used by the Power System operator immediately on the occurrence of a blackout in the electrical power supply. Our GA uses new initialization and crossover operators based on the electrical power network, which are able to generate and maintain the plans feasible along GA runs. This releases the Power Flow program, which represents the most computer demanding component, from computing the fitness function of unfeasible individuals. The method was designed for large transmission systems and results for three different electrical power networks are shown: IEEE 14-Bus, IEEE 30-Bus, and a large realistic system.
Leveraging Mobile Devices to Develop Intercultural Competency for Digital Students
Authors: Matthew Willis, Elaine M. Raybourn
Venue: Proceedings of the 3d International Conference on Online Communities and Social Computing: Held as Part of HCI International 2009 (2009)

Mobile devices can help digital students reach out across cultures to develop intercultural competence, improve learning, and provide course support for a variety of course topics. Intercultural competence is expressed through openness, cognitive adaptability, and behavioral flexibility toward unfamiliar cultures. Digital students demonstrate a behavioral flexibility toward technology use that can be leveraged to encourage students to embrace cultures different from their own. This paper explores the feasibility of using mobile devices as viable options for course support by utilizing traditional learning styles and cultural learning styles. From the conducted survey preferred networks are identified for creating a community to support mobile learning.
Automatic diacritization of Arabic for acoustic modeling in speech recognition
Authors: Dimitra Vergyri, Katrin Kirchhoff
Venue: Proceedings of the Workshop on Computational Approaches to Arabic Script-based Languages (2004)

Automatic recognition of Arabic dialectal speech is a challenging task because Arabic dialects are essentially spoken varieties. Only few dialectal resources are available to date; moreover, most available acoustic data collections are transcribed without diacritics. Such a transcription omits essential pronunciation information about a word, such as short vowels. In this paper we investigate various procedures that enable us to use such training data by automatically inserting the missing diacritics into the transcription. These procedures use acoustic information in combination with different levels of morphological and contextual constraints. We evaluate their performance against manually diacritized transcriptions. In addition, we demonstrate the effect of their accuracy on the recognition performance of acoustic models trained on automatically diacritized training data.
Detecting complex predicates in Hindi using POS projection across parallel corpora
Authors: Amitabha Mukerjee, Ankit Soni, Achla M. Raina
Venue: Proceedings of the Workshop on Multiword Expressions: Identifying and Exploiting Underlying Properties (2006)

Complex Predicates or CPs are multiword complexes functioning as single verbal units. CPs are particularly pervasive in Hindi and other Indo-Aryan languages, but an usage account driven by corpus-based identification of these constructs has not been possible since single-language systems based on rules and statistical approaches require reliable tools (POS taggers, parsers, etc.) that are unavailable for Hindi. This paper highlights the development of first such database based on the simple idea of projecting POS tags across an English-Hindi parallel corpus. The CP types considered include adjective-verb (AV), noun-verb (NV), adverb-verb (Adv-V), and verb-verb (VV) composites. CPs are hypothesized where a verb in English is projected onto a multi-word sequence in Hindi. While this process misses some CPs, those that are detected appear to be more reliable (83% precision, 46% recall). The resulting database lists usage instances of 1439 CPs in 4400 sentences.
Linguistic Models Construction and Analysis for Satisfaction Estimation
Authors: Natalia Ponomareva, Angels Catena
Venue: Proceedings of the 12th International Conference on Text, Speech and Dialogue (2009)

Automatic analysis of customer conversations would be beneficial for service companies to improve service quality. In this case, such customer characteristics as satisfaction or competence are of the special interest. Unfortunately, their manual estimation is very laborious and it has a high level of subjectivity. In this work, we aim at parameterization of dialogues for formal (automatic) assessment of customer satisfaction. We elaborate a set of linguistic indicators represented both by lexico-syntactic patterns and rules and introduce their classification by kind, location and sign. We propose several linear regression models for satisfaction estimation and check them and their parameters on statistical significance. The best of the models demonstrates rather high level of concordance between automatic and manual assessments.
Shared logistic normal distributions for soft parameter tying in unsupervised grammar induction
Authors: Shay B. Cohen, Noah A. Smith
Venue: Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics (2009)

We present a family of priors over probabilistic grammar weights, called the shared logistic normal distribution. This family extends the partitioned logistic normal distribution, enabling factored covariance between the probabilities of different derivation events in the probabilistic grammar, providing a new way to encode prior knowledge about an unknown grammar. We describe a variational EM algorithm for learning a probabilistic grammar based on this family of priors. We then experiment with unsupervised dependency grammar induction and show significant improvements using our model for both monolingual learning and bilingual learning with a non-parallel, multilingual corpus.
SemEval-2007 task 12: Turkish lexical sample task
Authors: Zeynep Orhan, Emine Çelik, Neslihan Demirgüç
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

This paper presents the task definition, resources, and the single participant system for Task 12: Turkish Lexical Sample Task (TLST), which was organized in the SemEval-2007 evaluation exercise. The methodology followed for developing the specific linguistic resources necessary for the task has been described in this context. A language-specific feature set was defined for Turkish. TLST consists of three pieces of data: The dictionary, the training data, and the evaluation data. Finally, a single system that utilizes a simple statistical method was submitted for the task and evaluated.
On the value of good advice: the complexity of A* search with accurate heuristics
Authors: Hang Dinh, Alexander Russell, Yuan Su
Venue: Proceedings of the 22nd national conference on Artificial intelligence - Volume 2 (2007)

We study the behavior of the classical A* search algorithm when coupled with a heuristic that provides estimates, accurate to within a small multiplicative factor, of the distance to a solution. We prove general upper bounds on the complexity of A* search, for both admissible and unconstrained heuristic functions, that depend only on the distribution of solution objective values. We go on to provide nearly matching lower bounds that are attained even by non-adversarially chosen solution sets induced by a simple stochastic model.
Sparse Cooperative Multi-agent Q-learning Based on Vector Potential Field
Authors: Liang Liu, Longshu Li
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 01 (2009)

Multi-agent reinforcement learning(RL) problems can in principle be solved by treating the joint actions of the agents as single actions and applying single-agent Q-learning. However, the number of joint actions is exponential in the number of agents, rendering this approach infeasible for most problems. We investigate a sparse cooperative of the Q-function based on vector potential field by only considering the joint actions in those states in which coordination is actually required in this paper. In all other states single-agent Q-learning is applied. This offers a compact state-action value representation, without compromising much in terms of solution quality. We distinguish the coordinated state by vector potential field. We have performed experiments in RoboCup simulation-2D and compared our algorithm to other multi-agent reinforcement learning algorithms with promising results.