ppxscal/embedding_network huggingface dataset:
Improving aggregate user utilities and providing fairness in multi-rate wireless lans
Authors: John Guttag
Venue:  (2006)

A distributed medium access control (MAC) protocol is responsible for allocating the shared spectrum efficiently and fairly among competing devices using a wireless local area network. Unfortunately, existing MAC protocols, including 802.11's DCF, achieve neither efficiency nor fairness under many realistic conditions. In this dissertation, we show that both bit and frame-based fairness, the most widely used notions, lead to drastically reduced aggregate throughput and increased average delay in typical environments, in which competing nodes transmit at different data transmission rates. We demonstrate the advantages of time-based fairness, in which each competing node receives an equal share of the wireless channel occupancy time. Through analysis, experiments on a Linux test bed, and simulation, we demonstrate that time-based fairness can lead to significant improvements in aggregate throughput and average delay. Through a game theoretic analysis and simulation, we also show that existing MAC protocols encourage non-cooperative nodes to employ globally inefficient transmission strategies that lead to low aggregate throughput. We show that providing long-term time share guarantees among competing nodes leads rational nodes to employ efficient transmission strategies at equilibriums. We describe two novel solutions, TES (Time-fair Efficient and Scalable MAC protocol) and TBR (Time-based Regulator) that provide time-based fairness and long-term time share guarantees among competing nodes. TBR is a backward-compatible centralized solution that runs at the AP, works in conjunction with DCF, and requires no modifications to clients nor to DCF. TBR is appropriate for existing access point based networks, but not effective when nearby non-cooperative nodes fall under different administrative domains. Our evaluation of TBR on an 802.11b/Linux test bed shows that TBR can improve aggregate TCP throughput by as much as 105% in rate diverse environments. TES is a non-backward compatible distributed contention-based MAC protocol that is effective in any environment, including non-cooperative environments. Furthermore, the aggregate throughputs sustained with increased loads. Through extensive simulation experiments, we demonstrate that TES is significantly more efficient (as much as 140% improvement in aggregate TCP throughput) and fairer than existing MAC protocols including DCF. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.) (Abstract shortened by UMI.)
Participatory, embodied, multi-agent simulation
Authors: Paulo Blikstein, William Rand, Uri Wilensky
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

We will demonstrate the integration of a software-based multi-agent modeling platform with a participatory simulation environment and real-time control over a physical agent (robot). Both real and virtual participants will be able to act as agents in a simulation that will control a physical agent. The backbone of this demonstration is a widely used, freely available, mature modeling platform known as NetLogo.
An Attribute-Based Access Control Model for Web Services
Authors: Hai-bo Shen, Fan Hong
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Web service is a new service-oriented computing paradigm which poses the unique security challenges due to its inherent heterogeneity, multi-domain characteristic and highly dynamic nature. A key challenge in Web services security is the design of effective access control schemes. However, most current access control systems base authorization decisions on subject's identity. Administrative scalability and control granularity are serious problems in those systems, and they are not fit for Web services environment. So an attribute-based access control model (WS-ABAC) is presented to address these issues in this paper. WS-ABAC grants access to services based on attributes of the related entities, and uses automated trust negotiation mechanism to address the disclosure issue of the sensitive attributes. It can provide administratively scalable alternative to identity-based authorization methods and provide fine-grained access control for Web services. Moreover, it also can protect user's privacy.
Data mining challenges in the automotive domain
Authors: Michael Cavaretta
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Automotive companies, such as Ford Motor Company, have no shortage of large databases with abundant opportunities for cost reduction and revenue enhancement. The Data Mining Group at Ford has worked in the areas of Quality, Customer Satisfaction and Warranty Analytics for close to ten years. In this time, we have developed a number of methods for building systems to help the business. One area of particular success has been in warranty analysis. While traditional hazard analysis has been applied at Ford for a number of years, we have used techniques from other industries (e.g. retail), as well as text mining to view warranty analytics in a new way. However, our success has been tempered by serious challenges particularly in the areas of data understanding, computing meaningful aggregations and implementation. Case studies from the automobile industry (warranty, quality, forecasting, etc.) as well as from other industries will be used.
Auditory Cortical Responses to Speech-Like Stimuli in Dyslexic Adults
Authors: Hanna Renvall, Riitta Hari
Venue: Journal of Cognitive Neuroscience (2002)

Auditory cortical processing of speech-like sounds was studied in 9 dyslexic and 11 normal-reading adults. Noise/square-wave sequences, mimicking transitions from a fricative consonant to a vowel, were presented binaurally once every 1.1 sec and the cortical responses were recorded with a whole-scalp neuromagnetometer. The auditory cortices of both hemispheres were less reactive to acoustical changes in dyslexics than in controls, as was evident from the weaker responses to the noise/square-wave transitions. The results demonstrate that dyslexic adults are deficient in processing acoustic changes presented in rapid succession within tens to hundreds of milliseconds. The observed differences could be related to insufficient triggering of automatic auditory attention, resulting, for instance, from a general deficiency of the magnocellular system.
Text mining without document context
Authors: Eric SanJuan, Fidelia Ibekwe-SanJuan
Venue: Information Processing and Management: an International Journal (2006)

We consider a challenging clustering task: the clustering of multi-word terms without document co-occurrence information in order to form coherent groups of topics. For this task, we developed a methodology taking as input multiword terms and lexico-syntactic relations between them. Our clustering algorithm, named CPCL is implemented in the Term-Watch system. We compared CPCL to other existing clustering algorithms, namely hierarchical and partitioning (k-means, k-medoids). This out-of-context clustering task led us to adapt multi-word term representation for statistical methods and also to refine an existing cluster evaluation metric, the editing distance in order to evaluate the methods. Evaluation was carried out on a list of multi-word terms from the genomic field which comes with a hand built taxonomy. Results showed that while k-means and k-medoids obtained good scores on the editing distance, they were very sensitive to term length. CPCL on the other hand obtained a better cluster homogeneity score and was less sensitive to term length. Also, CPCL showed good adaptability for handling very large and sparse matrices.
A generalized multiple response surface methodology for complex computer simulation applications
Authors: Jeffrey B. Schamburg, Donald E. Brown
Venue: Proceedings of the 36th conference on Winter simulation (2004)

This work provides a generalization of the traditional response surface methodology (RSM) that can be applied to complex, multi-objective simulation studies. These problems involve a larger number of input variables, multiple measures of performance, and complex systems relationships. This multiple RSM approach capitalizes on the underlying learning philosophy of the traditional RSM while benefiting from other knowledge discovery concepts and data mining techniques. Furthermore it does not require the restrictive assumptions of the traditional RSM nor does it restrict the analyst to the traditional RSM techniques. Based on a variation of (Brown and Schamburg 2004) and (Schamburg 2004), a brief description of the generalized approach is provided. Then, the multiple response techniques are shown through an example application.
An experimental study on algorithms for drawing binary trees
Authors: Adrian Rusu, Radu Jianu, Confesor Santiago, Christopher Clement
Venue: Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60 (2006)

In this paper we present the results of a comprehensive experimental study on the four most representative algorithms for drawing binary trees without distorting or occluding the information, one for each of the following distinct tree-drawing approaches: Separation-Based approach (Garg & Rusu 2003), Path-Based approach (Chan, Goodrich, Rao Kosaraju & Tamassia 2002), Level-Based approach (Reingold & Tilford 1981), and Ringed Circular Layout approach (Teoh & Ma 2002).Our study is conducted on randomly-generated, unbalanced, and AVL binary trees with up to 50,000 nodes, on Fibonacci trees with up to 46,367 nodes, on complete trees with up to 65,535 nodes, and on real-life molecular combinatory binary trees with up to 50,005 nodes. We compare the performance of the drawing algorithms with respect to five quality measures, namely Area, Aspect Ratio, Uniform Edge Length, Angular Resolution, and Farthest Leaf. None of the algorithms have been found to be the best in all categories.
Classification of subsets with minimal width and dual width Grassmann, bilinear forms and dual polar graphs
Authors: Hajime Tanaka
Venue: Journal of Combinatorial Theory Series A (2006)

Brouwer, Godsil, Koolen and Martin [Width and dual width of subsets in polynomial association schemes, J. Combin. Theory Set. A 102 (2003) 255-271] introduced the width w and the dual width w* of a subset in a distance-regular graph and in a cometric association scheme, respectively, and then derived lower bounds on these new parameters. For instance, subsets with the property w + w* = d in a cometric distance-regular graph with diameter d attain these bounds. In this paper, we classify subsets with this property in Grassmann graphs, bilinear forms graphs and dual polar graphs. We use this information to establish the Erdös-Ko-Rado theorem in full generality for the first two families of graphs.
Empirical likelihood for single-index models
Authors: Liu-Gen Xue, Lixing Zhu
Venue: Journal of Multivariate Analysis (2006)

The empirical likelihood method is especially useful for constructing confidence intervals or regions of the parameter of interest. This method has been extensively applied to linear regression and generalized linear regression models. In this paper, the empirical likelihood method for single-index regression models is studied. An estimated empirical log-likelihood approach to construct the confidence region of the regression parameter is developed. An adjusted empirical log-likelihood ratio is proved to be asymptotically standard chi-square. A simulation study indicates that compared with a normal approximation-based approach, the proposed method described herein works better in terms of coverage probabilities and areas (lengths) of confidence regions (intervals).
Stability results for linearly implicit fractional step discretizations of non-linear time dependent parabolic problems
Authors: B. Bujanda, J. C. Jorge
Venue: Applied Numerical Mathematics (2006)

Some stability results are analyzed for a variant of fractional step Runge-Kutta methods which is designed to integrate efficiently semi-linear multidimensional parabolic problems. These schemes are shown to be linearly implicit in combination with a suitable splitting of the space differential operator. We also give a proof for the convergence of such schemes, by combining the stability results of this paper with the corresponding properties of consistency.
Analysis of the RFID Security Protocol for Secure Smart Home Network
Authors: Hyun-Seok Kim, Jung-Hyun Oh, Jin-Young Choi
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

RFID(Radio Frequency Identification) has the potential to be efficiently used for object identification and most likely a majority of items in the supply chain will carry RFID labels in the future. However, widespread deployment of RFID tags may create new threats to user privacy due to the powerful tracking capability of the tags and drawbacks in authentication systems between reader and tag. Security mechanisms for RFID systems will be therefore of utmost important. In this paper, we analyze the vulnerabilities of the hash based RFID security protocol with Casper, CSP and FDR model checking tool and reconfirm the several known attacks. Finally, we propose the modified hash based RFID security protocol that guarantees data privacy and authentication between a tag and a reader.
An Evolutionary Basis for Preference Behavior in Decision Making under Risk
Authors: Shigemi SAWA, Hideaki ITOH, Kiyohiko NAKAMURA
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

In decision making under risk, people prefer the risk aversive choices for gains and the risk seeking choices for losses. This paper presents an analysis describing that those choices may increase the survival rate of the animals that made the choices. Two conditions for the same choices as people make to increase the survival rate. It also includes the predictions derived form the conditions and data that supports them.
Convergence of strikes in variance and volatility swaps
Authors: Ashish Jain
Venue: Proceedings of the 37th conference on Winter simulation (2005)

In this work we study the convergence of strikes in variance and volatility swaps with frequency of sampling and determine the convergence rate of discrete time strikes to continuous time strikes. In our work, we study three different models of underlying evolution Black Scholes, Heston Stochastic Volatility model and Affine Jump diffusion processes to calculate the strike of the swap. First we determine the analytical value of the strike of variance swap in all these three models and then using convexity adjustment formula we calculate the approximate fair strike of volatility swap. For studying the convergence rate of strikes we compute the strikes for different sampling frequency using Monte Carlo Simulation. We found that convergence rate is linear which is also supported from the theoretical results we have proved.
An architecture of a normative system: counts-as conditionals, obligations and permissions
Authors: Guido Boella, Leendert van der Torre
Venue: Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems (2006)

Normative systems are traditionally described and analyzed using deontic logic, describing the logical relations among obligations and permissions. However, there is still a gap between deontic logic and normative multi-agent systems such as electronic institutions, which may be seen as an instance of the gap between on the one hand logical agent specification languages and on the other hand agent architectures and programming languages. To bridge the gap, in this paper we propose an architecture containing separate subsystems or components for counts-as conditionals, conditional obligations and conditional permissions. We add a norm database component in which the three kinds of rules are stored, and we use a channel based coordination model to describe the relations among the four normative components.
Exploratory Under-Sampling for Class-Imbalance Learning
Authors: Xu-Ying Liu, Jianxin Wu, Zhi-Hua Zhou
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Under-sampling is a class-imbalance learning method which uses only a subset of major class examples and thus is very efficient. The main deficiency is that many major class examples are ignored. We propose two algorithms to overcome the deficiency. EasyEnsemble samples several subsets from the major class, trains a learner using each of them, and combines the outputs of those learners. BalanceCascade is similar to EasyEnsemble except that it removes correctly classified major class examples of trained learners from further consideration. Experiments show that both of the proposed algorithms have better AUC scores than many existing class-imbalance learning methods. Moreover, they have approximately the same training time as that of under-sampling, which trains significantly faster than other methods.
Local Area Networking
Authors: Michael N. Geselowitz
Venue: IEEE Annals of the History of Computing (2006)

Michael Geselowitz tours the Twin Cities of Minneapolis and St. Paul, Minnesota, and takesreaders to the Charles Babbage Institute, Control Data Corporation, Cray Research, Honeywell, and TheBakken.
Modeling and adaptive control of redundant robots
Authors: Brice Le Boudec, Maarouf Saad, Vahé Nerguizian
Venue: Mathematics and Computers in Simulation (2006)

This paper presents an adaptive control scheme for a hyper-redundant robot articulated nimble adaptable trunk (ANAT) subject to spatial constraints. An optimization scheme is applied to avoid obstacles in 3D space present in the robot's trajectory by using redundancy, and to prevent the robot from retracting and crashing into the base by setting a security envelop. The generation of the trajectory with obstacles avoidance is performed by calculating the differential inverse kinematics of the robot based on the generalized inverse function. The obstacles are modeled by hyper-surfaces in order to reduce calculations and improve the computation time. When the optimal trajectory is attained in presence of the imposed constraints, an adaptive control law is applied to the robot. Simulation results showed the effectiveness of the proposed approach.
Agent-based ontology integration for ontology-based applications
Authors: Li Li, Baolin Wu, Yun Yang
Venue: Proceedings of the 2005 Australasian Ontology Workshop - Volume 58 (2005)

In this paper, a novel agent-based ontology integration framework is developed for agents which consume ontologies in ontology-based applications as well as engage in tasks of ontology integration. The corresponding ontology integration mechanism is discussed. Derived ontologies can be reused in the system. A prototype is built by using the JADE agent platform for evaluation.
Quality Improvement through a Reminder System in an Outpatient Department for Thyroid Disease
Authors: Martin Reitstatter, Heinrich Vierhapper, Andrea Rappelsberger, Klaus-Peter Adlassnig
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

We discuss a reminder system that automatically interprets the results of routine biochemical tests for thyroid hormones. We measured serum levels of thyroid stimulating hormone (TSH), total thyroxin (TT4), triiodothyronine (TT3), thyroxin-binding globulin (TBG), and thyrotropin-releasing hormone (TRH)-stimulated TSH (sTSH [1,2]). The developed knowledge base was used to compare and rate these results with a defined set of diagnoses. Various forms of altered thyroid and/or pituitary function [3-8] were considered. For a given combination of test results, the reminder system classified the entered diagnoses as "obligatory", "possible", or 'excluded". The knowledge base is now part of a medical documentation system at the outpatient thyroid department of the Division of Endocrinology and Metabolism of the Vienna General Hospital. We report an evaluation performed after six months of operation. Although further improvement will be required, the knowledge-based reminder system in its present form is capable of improving the quality of manually entered diagnoses.
Predictable Performance in SMT Processors: Synergy between the OS and SMTs
Authors: Francisco J. Cazorla Peter M. W. Knijnenburg Rizos Sakellariou Enrique Fernandez Alex Ramirez Mateo Valero
Venue: IEEE Transactions on Computers (2006)

Current Operating Systems (OS) perceive the different contexts of Simultaneous Multithreaded (SMT) processors as multiple independent processing units, although, in reality, threads executed in these units compete for the same hardware resources. Furthermore, hardware resources are assigned to threads implicitly as determined by the SMT instruction fetch (Ifetch) policy, without the control of the OS. Both factors cause a lack of control over how individual threads are executed, which can frustrate the work of the job scheduler. This presents a problem for general purpose systems, where the OS job scheduler cannot enforce priorities, and also for embedded systems, where it would be difficult to guarantee worst-case execution times. In this paper, we propose a novel strategy that enables a two-way interaction between the OS and the SMT processor and allows the OS to run jobs at a certain percentage of their maximum speed, regardless of the workload in which these jobs are executed. In contrast to previous approaches, our approach enables the OS to run time-critical jobs without dedicating all internal resources to them so that non-time-critical jobs can make significant progress as well and without significantly compromising overall throughput. In fact, our mechanism, in addition to fulfilling OS requirements, achieves 90 precent of the throughput of one of the best currently known fetch policies for SMTs.
Analyzing Human Movements from Silhouettes Using Manifold Learning
Authors: Liang Wang, David Suter
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

A novel method for learning and recognizing sequential image data is proposed, and promising applications to vision-based human movement analysis are demonstrated. To find more compact representations of high-dimensional silhouette data, we exploit locality preserving projections (LPP) to achieve low-dimensional manifold embedding. Further, we present two kinds of methods to analyze and recognize learned motion manifolds. One is correlation matching based on the Hausdorrf distance, and the other is a probabilistic method using continuous hidden Markov models (HMM). Encouraging results are obtained in two representative experiments in the areas of human activity recognition and gait-based human identification.