ppxscal/embedding_network huggingface dataset:
Mining rank-correlated sets of numerical attributes
Authors: Toon Calders, Bart Goethals, Szymon Jaroszewicz
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

We study the mining of interesting patterns in the presence of numerical attributes. Instead of the usual discretization methods, we propose the use of rank based measures to score the similarity of sets of numerical attributes. New support measures for numerical data are introduced, based on extensions of Kendall's tau, and Spearman's Footrule and rho. We show how these support measures are related. Furthermore, we introduce a novel type of pattern combining numerical and categorical attributes. We give efficient algorithms to find all frequent patterns for the proposed support measures, and evaluate their performance on real-life datasets.
Using Conceptual Modeling and Value Analysis to Identify Sustainable m>Business Models in Industrial Services
Authors: Jesper Thestrup, Trine F. Sorensen, Mauro De Bona
Venue: Proceedings of the International Conference on Mobile Business (2006)

The industrial products and service industry is a product oriented industry, where traditional business models based on value chain optimization have been refined over many years. However, in order to increase business value, innovative industrial product companies are increasingly looking for new m- Business services related to their core business. With the emergence of such virtual markets (services, information, knowledge, life-style support, security) we need a new paradigm for understanding and predicting business performance. The concept "value constellation" replaces the value chain. A m-Business model is not sustainable if it lacks a sound economic value proposition to the end-user. In order to analyze and validate value creation in m- Business systems we suggest using a conceptual modeling methodology with proper value ontology. We will demonstrate how such a methodology will allow us to de-compose value offerings with the aim of identifying new stakeholders and new value constellations.
On the closedness of nilpotent DR tree languages under boolean operations
Authors: F. Gécseg, Gy. Gyurica
Venue: Acta Cybernetica (2006)

This note deals with the closedness of nilpotent deterministic root-to-frontier tree languages with respect to the Boolean operations union, intersection and complementation. Necessary and sufficient conditions are given under which the union of two deterministic tree languages is also deterministic. The paper ends with a characterization of the largest subclass of the class of nilpotent deterministic root-to-frontier tree languages closed under the formation of complements.
Resource Discovery in Networks under Bandwidth Limitations
Authors: Kishori M. Konwar, Alex A. Shvartsman
Venue: Proceedings of the Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (2006)

The Resource Discovery Problem [4], where cooperating machines need to find one another in a network, was introduced by Harchol-Balter, Leighton, and Lewin in the context of Akamai Technologies with the goal of building an Internet-wide content-distribution system. In the solutions for the synchronous setting proposed so far [4, 11, 12] there is a possibility that during some time step many machines may contact a single machine, and this is not a realistic assumption. This work assumes a synchronous model, however at each step a machine can send and receive only a constant number of messages. It is shown that the conjectured poly-logarithmic upper bound [4] for such a setting is not possible. This is done by proving a lower bound on time of \Omega(n), where n is the number of participating nodes. For this model a randomized algorithm is presented that solves the resource discovery problem in O(n log^2 n) time, i.e., within a poly-logarithmic factor of the corresponding lower bound. The algorithm has a O(n^2 log^2 n) message complexity and O(n^3 log^3 n) communication complexity. Simulation results for the algorithm illustrate the lower and upper bounds, and lead to interesting observations.
Modeling and Classifying Breast Tissue Density in Mammograms
Authors: Anna Bosch, Xavier Munoz, Arnau Oliver, Joan Marti
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We present a new approach to model and classify breast parenchymal tissue. Given a mammogram, first, we will discover the distribution of the different tissue densities in an unsupervised manner, and second, we will use this tissue distribution to perform the classification. We achieve this using a classifier based on local descriptors and probabilistic Latent Semantic Analysis (pLSA), a generative model from the statistical text literature. We studied the influence of different descriptors like texture and SIFT features at the classification stage showing that textons outperform SIFT in all cases. Moreover we demonstrate that pLSA automatically extracts meaningful latent aspects generating a compact tissue representation based on their densities, useful for discriminating on mammogram classification. We show the results of tissue classification over the MIAS and DDSM datasets. We compare our method with approaches that classified these same datasets showing a better performance of our proposal.
Fast and reliable estimation schemes in RFID systems
Authors: Murali Kodialam, Thyaga Nandagopal
Venue: Proceedings of the 12th annual international conference on Mobile computing and networking (2006)

RFID tags are being used in many diverse applications in increasingly large numbers. These capabilities of these tags span from very dumb passive tags to smart active tags, with the cost of these tags correspondingly ranging from a few pennies to many dollars. One of the common problems that arise in any RFID deployment is the problem of quick estimation of the number of tags in the field up to a desired level of accuracy. Prior work in this area has focused on the identification of tags, which needs more time, and is unsuitable for many situations, especially where the tag set is dense. We take a different, more practical approach, and provide very fast and reliable estimation mechanisms. In particular, we analyze our estimation schemes and show that the time needed to estimate the number of tags in the system for a given accuracy is much better than schemes presented in related work. We show that one can estimate the cardinality of tag-sets of any size in near-constant time, for a given accuracy of estimation.
Neuro-Fuzzy Network for Adaptive Channel Equalization
Authors: Rahib H. Abiyev, Tayseer Al-shanableh
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

This paper presents the equalization of channel distortion by using neuro-fuzzy network. The structure and learning algorithm of neuro-fuzzy network have been described. Using learning algorithm of neuro-fuzzy network an adaptive equalizer have been developed. The developed equalizer recovers transmitted signal efficiently. The use of neuro-fuzzy equalizer in digital signal transmission allows to decrease training time of parameters and the complexity of network. The result obtained from the simulation is compared with the simulation result of neural equalizer, and it is shown that neuro-fuzzy equalizer has better performance than other one.
Unwired Collective Action: Motivations of Wireless Community Participants
Authors: Maria Bina, George M. Giaglis
Venue: Proceedings of the International Conference on Mobile Business (2006)

A new organizational form which creates an innovative method for the deployment of a wireless communications infrastructure and promotes end-user collaboration has emerged in metropolitan areas all over the world: community-based WLANs. Insofar, research has focused on comparing the community model with commercial offerings of WLAN access and on placing wireless communities within a policy agenda. This paper attempts to explore the capabilities of community-based WLANs through a combination of theoretical reasoning and empirical evidence. It applies collective action and social dilemmas theories to attest that motivation plays a critical role in the formation and sustained existence of wireless communities. Using evidence from a large-scale survey, it characterizes wireless community participants based on their motivational inclinations. Furthermore, the paper develops a taxonomy of community participants to be used for explaining how individuals solve the social dilemmas associated with their participation in a community-based WLAN.
Paired Comparisons Method for Solving Multi-Label Learning Problem
Authors: Mikhail Petrovskiy
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

Multi-label classification problem is a further generalization of traditional multi-class learning problem. In multi-label case the classes are not mutually exclusive and any sample may belong to several classes at the same time. Such problems occur in many important applications (in bioinformatics, text categorization, intrusion detection, etc.). In this paper we propose a new method for solving multi-label learning problem, based on paired comparisons approach. In this method each pair of possibly overlapping classes is separated by two probabilistic binary classifiers, which isolate the overlapping and non-overlapping areas. Then individual probabilities generated by binary classifiers are combined together to estimate final class probabilities fitting extended Bradley-Terry model with ties. Experimental performance evaluation on well-known multi-label benchmark datasets has demonstrated the outstanding accuracy results of the proposed method.
Exploring the Activation of Semantic and Phonological Codes during Speech Planning with Event-Related Brain Potentials
Authors: Jörg D. Jescheniak, Herbert Schriefers, Merrill F. Garrett, Angela D. Friederici
Venue: Journal of Cognitive Neuroscience (2002)

We present a new technique for studying the activation of semantic and phonological codes in speech planning using event-related brain potentials (ERPs) that extend a well-established behavioral procedure from speech production research. It combines a delayed picture-naming task with a priming procedure. While participants prepared the production of a depicted object's name, they heard an auditory target word. If the prepared picture name and the target word were semantically or phonologically related, the ERP waveform to the target word tended less towards the negative when compared to an unrelated control. These effects were widely distributed. By contrast, if participants performed a nonlinguistic task on the depicted object (natural size judgment), the semantic effect was still obtained while the phonological effect disappeared. This suggests that the former effect indexes semantic activation involved in object processing while the latter effect indexes word-form activation specific to lexical processing. The data are discussed in the context of models of lexical access in speech production.
Leaving the world behind: supporting group collaboration patterns in a shared virtual environment for product design
Authors: John M. Linebarger, Christopher D. Janneck, G. Drew Kessler
Venue: Presence: Teleoperators and Virtual Environments (2005)

Virtual reality technology is increasingly being applied to globally distributed teams engaged in collaborative product design. Observations of product design teams have suggested four distinct patterns of collaboration complementary, competitive, peer-to-peer, and leader-follower. Another insight from observation is that collaboration consists of fluid transitions between these patterns in the accomplishment of the design task, driven by a flexible process of subgrouping and regrouping which reflects the structure and progress of the task. Yet most collaborative virtual environment systems support only one pattern of collaboration--peer-to-peer--and those that do explicitly support multiple patterns or roles do not allow fluid transitions between them in the context of the same task. In addition, no explicit support is provided to allow subgroups to be formed and dissolved. A collaborative virtual environment that supports multiple collaboration patterns and fluid transitions was developed using the Shared Simple Virtual Environment (SSVE) application framework. A novel user interface widget, the collaboration tree, was created to drive the subgrouping and regrouping process. Group experiments were performed to test the operating hypothesis that support for group collaboration patterns led to higher performance. The result was that the operating hypothesis was confirmed; however, the conceptual approach to problem solving, suggested by the presence of support for collaboration patterns, may have been more significant than the actual mechanism provided.
Fault-Tolerant Distributed Stream Processing System
Authors: Marcin Gorawski, Pawel Marks
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Real-time data processing systems are more and more popular nowadays. Data warehouses not only collect terabytes of data, they also process endless data streams. To support such a situation a data extraction process must become a continuous process also. Here a problem of a failure resistance arises. It is important not only to process a set of data on time, even more important is not to lose any data when a failure occurs. We achieve this by applying a redundant distributed stream processing. In this paper we present a fault-tolerant system designed for processing data streams originating from geographically distributed sources.
Solidification of a binary alloy: finite-element, single-domain simulation and new benchmark solutions
Authors: Michael Le Bars, M. Grae Worster
Venue: Journal of Computational Physics (2006)

A finite-element simulation of binary alloy solidification based on a single-domain formulation is presented and tested. Resolution of phase change is first checked by comparison with the analytical results of Worster [M.G. Worster, Solidification of an alloy from a cooled boundary, J. Fluid Mech. 167 (1986) 481-501] for purely diffusive solidification. Fluid dynamical processes without phase change are then tested by comparison with previous numerical studies of thermal convection in a pure fluid [G. de Vahl Davis, Natural convection of air in a square cavity: a bench mark numerical solution, Int. J. Numer. Meth. Fluids 3 (1983) 249-264; D.A. Mayne, A.S. Usmani, M. Crapper, h-adaptive finite element solution of high Rayleigh number thermally driven cavity problem, Int. J. Numer. Meth. Heat Fluid Flow 10 (2000) 598-615; D.C. Wan, B.S.V. Patnaik, G.W. Wei, A new benchmark quality solution for the buoyancy driven cavity by discrete singular convolution, Numer. Heat Transf. 40 (2001) 199-228], in a porous medium with a constant porosity [G. Lauriat, V. Prasad, Non-darcian effects on natural convection in a vertical porous enclosure, Int. J. Heat Mass Transl. 32 (1989) 2135-2148; P. Nithiarasu, K.N. Seetharamu, T. Sundararajan, Natural convective heat transfer in an enclosure filled with fluid saturated variable porosity medium, Int. J. Heat Mass Transf. 40 (1997) 3955-3967] and in a mixed liquid-porous medium with a spatially variable porosity [P. Nithiarasu, K.N. Seetharamu, T. Sundararajan, Natural convective heat transfer in an enclosure filled with fluid saturated variable porosity medium, Int. J. Heat Mass Transf. 40 (1997) 3955-3967; N. Zabaras, D. Samanta, A stabilized volume-averaging finite element method for flow in porous media and binary alloy solidification processes, Int. J. Numer. Meth. Eng. 60 (2004) 1103-1138]. Finally, new benchmark solutions for simultaneous flow through both fluid and porous domains and for convective solidification processes are presented, based on the similarity solutions in corner-flow geometries recently obtained by Le Bars and Worster [M. Le Bars, M.G. Worster, Interfacial conditions between a pure fluid and a porous medium: implications for binary alloy solidification, J. Fluid Mech. (in press)]. Good agreement is found for all tests, hence validating our physical and numerical methods. More generally, the computations presented here could now be considered as standard and reliable analytical benchmarks for numerical simulations, specifically and independently testing the different processes underlying binary alloy solidification.
Sluice: Secure Dissemination of Code Updates in Sensor Networks
Authors: Patrick E. Lanigan, Rajeev Gandhi, Priya Narasimhan
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

Existing network reprogramming protocols target the efficient, reliable, multi-hop dissemination of application updates in sensor networks, but assume correct or fail-stop behavior from participating sensors. Compromised nodes can subvert such protocols to result in the propagation and remote installation of malicious code. Sluice aims for the progressive, resource-sensitive verification of updates in sensor networks to ensure that malicious updates are not disseminated or installed, while trusted updates continue to be efficiently disseminated. Our verification mechanism provides authenticity and integrity through a hash-chain construction that amortizes the cost of a single digital signature over an entire update. We integrate Sluice with an existing network reprogramming protocol and empirically evaluate its effectiveness both in a real sensor testbed and through simulation.
Wireless laptops in the classroom (and the Sesame Street syndrome)
Authors: Dennis Adams
Venue: Communications of the ACM (2006)

Give instructors the option of turning off wireless Web access to accommodate their students' learning styles, in some cases to save them from themselves.
An Embedded Architecture for Mission Control of Unmanned Aerial Vehicles
Authors: E. Pastor, J. Lopez, P. Royo
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

This paper presents an embedded hardware/software architecture specially designed to be applied on Unmanned Aerial Vehicles (UAV). With the advent of emerging civil applications, a class of mini/micro UAVs is emerging. This type of UAVs share the same limitations as most commercial embedded systems: space, power resources, computational requirements, complexity, etc. UAVs are automatically piloted by an embedded system named "Flight Control System". Many of those systems are available today, however no system exists nowadays that provides support to the actual mission that the UAV should perform. The architecture that we introduce in this work is specially designed to operate as payload and mission controller in the UAV.
Dependency of Network Structures in Agent Selection and Deployment
Authors: Kensuke Fukuda, Toshio Hirotsu, Satoshi Kurihara, Shin-ya Sato, Osamu Akashi, Toshiharu Sugawara
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

This paper shows that the statistical properties of the network topology are indispensable information for improving performance of multi-agent systems (MASs), though they have not received much attention in previous MAS research. In particular we focus on the applicability of the degree of an agent--the number of links among neighboring agents-- to load-balancing for the agent selection and deployment problem. The proposed selection algorithm does not need global information about the network structure and only requires the degree of a server agent and the degrees of the nodes neighboring the server agent. Through simulation of several topologies reproduced by the theoretical network models, we show that the use of the local topological information significantly improves the fairness of the servers even for a large-scale network. We also find that the key mechanisms for load-balancing in a given network topology are highly asymmetric degree characteristics (scalefree) and the negative degree correlation.
Practical Use of Software Reliability Methods in New Product Development
Authors: Raija Suikki
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

This paper presents seven software reliability estimation methods studied in the Nokia case unit, which operates in turbulent telecommunications business environment characterised by uncertainty and inability to predict the future. Tens of software reliability models have been developed since the beginning of 1970's. However, a few - if not any - of them have worked optimally across projects. This paper focuses on investigating the practical use of the methods in real-life complex development situations and demonstrates how the methods can be applied to new product development (NPD) process in the case unit. The results show that none of the methods operate alone but need to be combined with each other. Finally, ideas for further research are proposed.
Neural Substrates of Action Event Knowledge
Authors: Joseph W. Kable, Jessica Lease-spellmeyer, Anjan Chatterjee
Venue: Journal of Cognitive Neuroscience (2002)

Human concepts can be roughly divided into entities (prototypically referred to in language by nouns) and events (prototypically referred to in language by verbs). While much work in cognitive neuroscience has investigated how the brain represents different categories of entities, less attention has been given to the more basic distinction between entities and events. We used functional magnetic resonance imaging to examine brain activity while subjects performed a conceptual matching task that required them to access knowledge of objects and actions, using either pictures or words. Since action events involve movement through space, we hypothesized that accessing knowledge of actions would cause greater activation in brain regions involved in motion or spatial processing. In comparison to objects, accessing knowledge of actions through pictures was accompanied by increased activity bilaterally in the human MT/MST and nearby regions of the lateral temporal cortex. Accessing knowledge of actions through words activated areas just anterior and dorsal to area MT/MST on the left, within the posterior aspect of the middle and superior temporal gyri. We propose that the lateral occipital-temporal cortex contains a mosaic of neural regions that processes different kinds of motion, ranging from the perception of objects moving in the world to the conception of movement implied in action verbs. The lateral occipital-temporal cortex mediates the perceptual and conceptual features of action events, similar to the way that the ventral occipital-temporal cortex processes the perceptual and conceptual features of entities.
Design of AC-PDP Signal Processor for SoC Application
Authors: Song Qiu, Wai-yun Li, Jin-gao Liu, Wen-jing Hu
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

This paper describes the design and implementation of a synthesizable, flexible, alternative current-plasma display panel (AC-PDP) signal processor (APSP) as an intellectual property (IP) core for system-on-a-chip (SoC) application. The APSP adopts the Improved Address and Display Separation (ADS) method we proposed to overcome the dynamic false contour (DFC) problem. The Finite State Machine (FSM) Design of the APSP are discussed in this paper. The Post-Place & Route simulation waveform based on VHDL is also proposed in this paper.