ppxscal/embedding_network huggingface dataset:
Mining HLA Patterns Explaining Liver Diseases
Authors: Michele Berlingerio, Francesco Bonchi, Silvia Chelazzi, Michele Curcio, Fosca Giannotti, Fabrizio Scatena
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

HumanLeukocyteAntigens (HLA), also known as histocompatibility antigens, are molecules found on all nucleated cells in the body. Histocompatibility antigens help the immune system to recognize whether or not a cell is foreign to the body, hence the success of an organ transplantation is strongly connected to the HLA systems of the donor-recipient pair. Beyond this important role, the HLA system seems to influence also the clinical course of hepatic cirrhosis, both on viral and autoimmune basis. However, not only different antigens have different importance w.r.t. hepatic cirrhosis, but, to make things more complicated, other not yet well characterized factors could play an important role. It is thus important to assess the existence of associations between haplotypic settings (possibly mixed with clinical and demographical information) and hepatic cirrhosis.Algorithms developed for frequent patterns discovery can help us achieve this goal. Thanks to their ability in handling a very large number of variables and the associated exponential search space, such techniques can discover interesting haplotypic patterns beyond traditional analysis methods capabilities.
Advanced Indexing Techniques for Wide-Area Network Monitoring
Authors: Xin Li, Fang Bian, Hui Zhang, Christophe Diot, Ramesh Govindan, Wei Hong Hong, Gianluca Lannaccone
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Detecting and unraveling incipient coordinated attacks on Internet resources requires a distributed network monitoring infrastructure. Such an infrastructure will have two logically distinct elements: distributed monitors that continuously collect packet and flow-level information, and a distributed query system that allows network operators to effi- ciently and rapidly access this information. We argue that, in addition to supporting other types of queries, the network monitoring query system must support multi-dimensional range queries on traffic records (flows, or aggregated flow records). We discuss the design of MIND, a distributed indexing system which supports the creation of multiple distributed indices that use proximal hashing to scalably respond to range queries.
Simulated environments for learning real world contexts in chemical engineering
Authors: Mark Guzdial, Noel Rappin, Matthew Realff, Pete Ludovice
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

The goal of DEVICE (Dynamic Environment for Visualization in Chemical Engineering) is to facilitate student learning through construction of models and evaluation of the models executing as simulations. In DEVICE, students solve real world problems in a simulated environment with visualizations that help establish the realistic context. The model underlying the simulation is visible, manipulable, and represented in a form that easily connects with the students' theoretical understanding. Students construct their own models to explain the behavior of the system. With DEVICE, we hope to find a middle ground between merely viewing a simulation and building one from scratch where the students are able to actually complete and learn through modeling tasks. The first version of DEVICE allowed students to view, but not manipulate, the model. User tests showed that the models need to be malleable at the modeling level, not just the simulation level.
Some remarks on self-tuning logical database design
Authors: Fabien De Marchi, Mohand-Said Hacid, Jean-Marc Petit
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Whereas self-tuning physical database design has received a lot of attention recently, self-tuning logical database design seems to be under-studied. Roughly speaking, database administrators (DBA) have to maintain on a daily basis "efficient databases", i.e. databases for which SQL queries have to perform effi- ciently for end-users, while keeping "coherent" databases, i.e. databases without update problems. Moreover, the huge number of null values occurring in practice may incur a significant overhead on his daily work, either to optimize the memory layout or to maintain (or design new) SQL queries. In order to reach a trade-off between the desire to maintain efficient databases and coherent databases, we propose a framework in which a database should be able to self-tuning its logical database schema with respect to SQL workloads and the data themselves. We discuss the main points of this framework, its feasibility and its relationships with some data mining problems.
Controlling spam with SpamAssassin
Authors: Colin McGregor
Venue: Linux Journal (2007)

Assassinate spam with extreme prejudice.
Towards a Semi-Automatic Ontology Mapping - An Approach Using Instance Based Learning and Logic Relation Mining
Authors: Xi-Juan Liu, Ying-Lin Wang, Jie Wang
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

To share information and knowledge of heterogeneous systems, one of the key issues is the mapping of their ontologies for interoperability. As manual mapping is too tedious, labor intensive, and prone to errors to support complex applications, investigating (semi-) automatic methods for ontology mapping becomes an imperative need. In recent years automatic ontology mapping arouses researchers' interests and valuable progresses have been made. However, there are still few reliable methods that have been successfully employed in real applications. In this paper we present a novel approach for systematically integrating all the available information including labels, instances, structures and former mapping experiences for semi-automatic mapping of heterogeneous ontologies. In this approach, we use four steps in making the decisions for mapping. Firstly we adopt an instance-based matching process that is a slight modification of GLUE to find the possible concept mappings between two ontologies. Secondly we use former indexed experiences that embed domain knowledge to modify the result. Thirdly a graph-based iteration process is executed in order to take the different information and knowledge structures into consideration. To eliminate negative efforts of structure heterogeneity we make a preprocessing for the structure reorganization via modifying the structures of ontologies before the iteration. Finally the attribute correspondences are identified through a mining and matching process for the logic relations among ontologies.
Adaptive MAC Scheme Ready for Delay Assurances in Wireless Networks
Authors: Fan Zhang, Benxiong Huang, Lai Tu, Jian Zhang
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Providing multiple classes of delay assurances to end-to-end applications is one of the key challenges in multihop WLAN's. In this paper, we propose a new scheme called Delay Feedback Adaptive Control (DFAC), which is a preparation to implement end-toend delay guarantee in multihop WLAN. It is derived from Enhanced Distributed Channel Access (EDCA) in IEEE 802.11e. DFAC can adaptively adjust the parameters of each traffic class according to the transmission delay. We evaluate the performance of DFAC through simulation. Results show that DFAC can improve the throughput of traffic class with high priority, and provide delay assurance effectively for real-time traffic in single-hop. Then we can use DFAC to ensure the delay of traffic within the specific rang in every single-hop, adaptively adjusting the priority of each traffic classes according to the average per-hop requested time, thus the end-to-end delay assurances will come to realize on the whole path.
LightHolder: A Platform for Real-World Mobile Commerce
Authors: Takushi Sogo, Yuichi Koike
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

Recently, some of cellular phones in the market are equipped with wireless local communication devices such as infrared, Bluetooth, and a contactless IC chip, and several companies are trying to launch real-world mobile commerce services. However, the services have not become widespread yet. In order to realize the market penetration of the services, this research focuses on the mechanism for enhancing users' convenience and service flexibility. In the architecture proposed in this paper, a service execution engine in a user's cellular phone works as a common platform for multiple services. It automatically installs and updates service data stored in the cellular phone if necessary (called service plug-and-play). Based on the proposed architecture, we have developed a platform for real-world mobile commerce (called LightHolder) and have evaluated it through the development of several prototype services.
Author Index
Venue: Proceedings of the 2000 IEEE International Symposium on Performance Analysis of Systems and Software (2000)

The paper describes a queuing network model for a multiprocessor system running a static Web workload such as SPECweb96. The model includes architectural details of the Web server in terms of multilevel cache hierarchy, processor bus, memory pipeline, PCI bus based I/O subsystem, and bypass I/O-memory path for DMA transfers. The model is based on detailed measurements from a baseline system and a few of its variants. The model operates at the Web transaction level, and does not explicitly model the CPU core or the caching hierarchy. Yet, the model predicts the performance impact of low level features such as number of processors, processor speeds, cache sizes and latencies, memory latencies, higher level caches, sector prefetching, etc. The model shows an excellent match with measured results. Because of many features that are difficult to handle analytically, the default solution technique is simulation. However, the paper also proposes a simple hybrid approach that can significantly speed up the solution without affecting the accuracy appreciably. The model has also been extended to handle clusters of symmetric multiprocessor systems with both centralized and distributed memories. 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
Deriving the type flaw attacks in the Otway-Rees protocol by rewriting
Authors: Monica Nesi, Giustina Nocera
Venue: Nordic Journal of Computing (2006)

This paper presents an approach to formalizing and verifying security protocol specifications based on rewriting techniques. A rewrite system Rp describes the steps of a protocol and the properties under consideration, and a rewrite system RI defines an intruder's ability of decomposing and decrypting messages. The equational theory generated by R = RP∪RI characterizes the recognizability of terms by an intruder, i.e. how an intruder can learn (parts of) messages exchanged among principals communicating over an insecure network. Security properties, such as authentication and secrecy, can be expressed by means of intruder's recognizability, and verifying whether a term is recognized by an intruder reduces to checking whether such a term can be rewritten to a normal form in the intruder's initial knowledge. A rewriting strategy is defined that, given a term t that represents a property to be proved, suitably expands and reduces t using the rules in R to derive whether or not t is recognized by an intruder. The approach is applied on the Otway-Rees symmetric-key protocol by deriving its well-known type flaw attacks.
A Graph Based Simulation of Reorganization in Multi-agent Systems
Authors: Zheng-guang Wang, Xiao-hui Liang
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

It is necessary for an organization to react to various changes from both the external environment and internal elements in multi-agent systems since existing open, dynamic environments. Reorganization provides the adaptive capabilities of an organization to deal with these changes and becomes one of the key issues of organization theories. To represent and simulate the dynamic process of reorganization in multi-agent system, in this paper, we propose a graph transformation based approach in the context of organizational structures and introduce a quantitative simulation of predator/prey game to show how the reorganization process can be enforced with this model and to indicate preliminary results of the reorganization simulation based on this graph transformation approach.
Incremental maintenance of aggregate and outerjoin expressions
Authors: Himanshu Gupta, Inderpal Singh Mumick
Venue: Information Systems (2006)

Views stored in a data warehouse need to be kept current. As recomputing the views is very expensive, incremental maintenance algorithms are required. Over recent years, several incremental maintenance algorithms have been proposed. None of the proposed algorithms handle the general case of relational expressions involving aggregate and outerjoin operators efficiently.In this article, we develop the change-table technique for incrementally maintaining general view expressions involving relational and aggregate operators. We show that the change-table technique outperforms the previously proposed techniques by orders of magnitude. The developed framework easily extends to efficiently maintaining view expressions containing outerjoin operators. We prove that the developed change-table technique is an optimal incremental maintenance scheme for a given view expression tree under some reasonable assumptions.
Alibaba International: Building a Global Electronic Marketplace
Authors: Jingzhi Guo, Iok Ham Lam, Ieong Lei, Xin Guan, Pei Hin Iong, Meng Chao Ieong
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Alibaba is the largest global electronic marketplace (GEM) in the world in terms of its participated users. It was successful due to the factors of China's foreign trade regime, the image of low product cost of China, Alibaba's contingent adaptation to users' changing requirements and e-commerce environments. Alibaba is not a technically mature GEM platform compared with the ideal functions of GEM. Suggested solution for Alibaba to continuing its success is to adopt a novel GEM connectivity model.
Locally Linear Models on Face Appearance Manifolds with Application to Dual-Subspace Based Classification
Authors: Wei Fan, Dit-Yan Yeung
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

Recently, there has been a flurry of research on face recognition based on multiple images or shots from either a video sequence or an image set. This paper is also such an attempt in multiple-shot face recognition. Specifically, we propose a novel nonparametric method that first extracts discriminating local models via clustering. We apply a hierarchical distance-based clustering procedure according to some distance measure on the appearance manifold to cluster similar face images together. Based on the local models extracted, we then construct the intrapersonal and extrapersonal subspaces. Given a new test image, the angle between the projections of the image onto the two subspaces is used as a distance measure for classification. Since a test example contains multiple face images in multiple-shot face recognition, the final classification combines the classification decisions of all individual test images via a majority voting scheme. We compare our method empirically with some previous methods based on a database of video sequences of human faces, showing that out method significantly outperforms other methods.
Adviser: Immersive Field Work for Planetary Geoscientists
Authors: Andrew Forsberg, Prabhat, Graff Haley, Andrew Bragdon, Joseph Levy, Caleb I. Fassett, David Shean, James W. Head III, Sarah Milkovich, Mark Duchaineau
Venue: IEEE Computer Graphics and Applications (2006)

The Adviser prototype system makes it possible for planetary geologists to conduct virtual field research on remote environments such as Antarctica and Mars. Among Adviser's interactive tools are mission-planning and measurement tools that let researchers generate new data and gain interpretive insights. Five case studies illustrate the system's applications and observed benefits.
Minimizing energy for wireless web access with bounded slowdown
Authors: Ronny Krashinsky, Hari Balakrishnan
Venue: Wireless Networks (2005)

On many battery-powered mobile computing devices, the wireless network is a significant contributor to the total energy consumption. In this paper, we investigate the interaction between energy-saving protocols and TCP performance for Web-like transfers. We show that the popular IEEE 802.11 power-saving mode (PSM), a "static" protocol, can harm performance by increasing fast round trip times (RTTs) to 100 ms; and that under typical Web browsing workloads, current implementations will unnecessarily spend energy waking up during long idle periods.To overcome these problems, we present the Bounded-Slowdown (BSD) protocol, a PSM that dynamically adapts to network activity. BSD is an optimal solution to the problem of minimizing energy consumption while guaranteeing that a connection's RTT does not increase by more than a factor p over its base RTT, where p is a protocol parameter that exposes the trade-off between minimizing energy and reducing latency. We present several trace-driven simulation results that show that, compared to a static PSM, the Bounded-Slowdown protocol reduces average Web page retrieval times by 5-64%, while simultaneously reducing energy consumption by 1-14% (and by 13× compared to no power management).
Second-Order Optimality Conditions for Scalar and Vector Optimization Problems in Banach Spaces
Authors: Helmut Gfrerer
Venue: SIAM Journal on Control and Optimization (2006)

In this paper we present a very general and unified theory of second-order optimality conditions for general optimization problems subject to abstract constraints in Banach spaces. Our results apply both to the scalar case and the multicriteria case. Our approach rests essentially on the use of a signed distance function for characterizing metric regularity of a certain multifunction associated with the problem. We prove variational results which show that, in a certain sense, our results are the best possible that one can obtain by using second-order analysis. We demonstrate how recently devised optimality conditions can be derived from our general framework, how they can be extended under weakened assumptions from the scalar case to the multiobjective case, and even how some new results also can be obtained.
Relative Shift in Activity from Medial to Lateral Frontal Cortex During Internally Versus Externally Guided Word Generation
Authors: Bruce Crosson, Joseph R. Sadek, Leeza Maron, Didem Gökçay, Cecile M. Mohr, Edward J. Auerbach, Alan J. Freeman, Christiana M. Leonard, Richard W. Briggs
Venue: Journal of Cognitive Neuroscience (2001)

Goldberg (1985) hypothesized that as language output changes from internally to externally guided production, activity shifts from supplementary motor area (SMA) to lateral premotor areas, including Broca's area. To test this hypothesis, 15 right-handed native English speakers performed three word generation tasks varying in the amount of internal guidance and a repetition task during functional magnetic resonance imaging (fMRI). Volumes of significant activity for each task versus a resting state were derived using voxel-by-voxel repeated-measures t tests (p < .001) across subjects. Changes in the size of activity volumes for left medial frontal regions (SMA and pre-SMA/BA 32) versus left lateral frontal regions (Broca's area, inferior frontal sulcus) were assessed as internal guidance of word generation decreased and external guidance increased. Comparing SMA to Broca's area, Goldberg's hypothesis was not verified. However, pre-SMA/BA 32 activity volumes decreased significantly and inferior frontal sulcus activity volumes increased significantly as word generation tasks moved from internally to externally guided.
Achieving Pareto-Efficient Bandwidth Allocations Using a Non-Monetary Mechanism
Authors: Andre Riedel, Timo Fischer
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

In this paper, we present a mechanism on a nonmonetary level that achieves Pareto-efficient bandwidth allocation in a network. Monetary mechanisms, known as Congestion Pricing, are subject to implementation issues and opposed by conceptional questions in a scenario on end user level. Therefore we conducted our research in the field of non-monetary bandwidth allocation mechanisms. Nonmonetary mechanisms suffer from the problem of preference elicitation. The issue of preference elicitation is predominantly solved using implementations of the Clark-Groves mechanism, such as a Vickrey auction. At present there exists no applicable transformation of a Clark-Groves mechanism on a non-monetary level. Therefore we propose a mechanism that alters users strategy space via incentives such that truthful preference elicitation becomes a dominant strategy in a repeated game. Our mechanism is based on the intuition that preferences can be elicitated via implied behaviour. It is thus possible to obtain Pareto-efficient allocations if users get incentives to only ask for bandwidth if their marginal utility exceeds marginal social costs. Furthermore, the resulting bandwidth allocation possesses the desired property of Nash bargaining fairness.
Wireless LANs Systems: An Advanced Resource Assignement Algorithm
Authors: Giuseppe Razzano, Francesco Delli Priscoli, Roberto Cusani
Venue: Wireless Personal Communications: An International Journal (2006)

The paper describes the design and simulation of a radio modem architecture, which provides wireless access to Internet in a single-hop, ad hoc network.The main emphasis is on the Medium Access Control (MAC) and Dynamic Link Control (DLC) layer's design, and in particular on the adopted innovative scheduling algorithm, which has been developed to satisfy the system requirements of the WIND-FLEX radio modem. The algorithm is presented and compared to the Earliest Deadline First (EDF) solution.Several software simulation tests have been executed on the network, to test the performance of the system, in order to verify the capability of the scheduler algorithm to satisfy the expected requirements and the efficiency of the implemented solutions.
Familiarity Affects the Processing of Task-irrelevant Auditory Deviance
Authors: Thomas Jacobsen, Erich Schröger, István Winkler, János Horváth
Venue: Journal of Cognitive Neuroscience (2005)

The effects of familiarity on auditory change detection on the basis of auditory sensory memory representations were investigated by presenting oddball sequences of sounds while participants ignored the auditory stimuli. Stimulus sequences were composed of sounds that were familiar and sounds that were made unfamiliar by playing the same sounds backward. The roles of frequently presented stimuli (standards) and infrequently presented ones (deviants) were fully crossed. Deviants elicited the mismatch negativity component of the event-related brain potential. We found an enhancement in detecting changes when deviant sounds appeared among familiar standard sounds compared when they were delivered among unfamiliar standards. Familiarity with the deviant sounds also enhanced the change-detection process. We suggest that tuning to familiar items sets up preparatory processes that affect change detection in familiar sound sequences.