ppxscal/embedding_network huggingface dataset:
An Improved Ellipse Propagation Model for Location Estimation in Facilitating Ubiquitous Computing
Authors: Junyang Zhou, Kenneth Man-Kin Chu, Joseph Kee-Yin Ng
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Positioning is a crucial technology for ubiquitous computing. A directional propagation model - the Ellipse Propagation Model (EPM) is proposed by our research group for locating a mobile station (MS) within a radio cellular network with an accuracy that can enable a number of location based services to realize ubiquitous computing. By using a Geometric Algorithm, the location of the mobile station can be estimated. However, since one parameter in our Geometric Algorithm is fixed, errors may be induced as the surrounding environment changes. In view of this, we would like to propose a new algorithm - the Iterative Algorithm to provide the positioning based on EPM. With the technical support of two local mobile phone operators, we have conducted a series of experiments using real data and experiment results showed that the proposed Iterative Algorithm outperforms the Geometric Algorithm by a good margin of 18% in terms of average error.
A Model-Free and Stable Gene Selection in Microarray Data Analysis
Authors: Kun Yang, Jianzhong Li, Zhipeng Cai, Guohui Lin
Venue: Proceedings of the Fifth IEEE Symposium on Bioinformatics and Bioengineering (2005)

Microarray data analysis is notorious for involving a huge number of genes compared to a relatively small number of samples. Detecting the most significantly differentially expressed genes under different conditions, or gene selection, has been a central focus for researchers. The gene selection problem becomes more difficult when the numbers of samples under different conditions vary significantly, or are unbalanced. A novel model-free and stable gene selection method is proposed in this paper, i.e., the method does not assume any statistical model on the gene expression data and it is not affected by the unbalanced samples. The method has been evaluated on two publicly available datasets, the leukemia dataset and the small round blue cell tumor dataset, where the experimental results showed that the proposed method is efficient and robust in identifying differentially expressed genes.
Discriminant Analysis: A Unified Approach
Authors: Peng Zhang, Norbert Riedel
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Linear discriminant analysis (LDA) as a dimension reduction method is widely used in data mining and machine learning. It however suffers from the small sample size (SSS) problem when data dimensionality is greater than the sample size. Many modified methods have been proposed to address some aspect of this difficulty from a particular viewpoint. A comprehensive framework that provides a complete solution to the SSS problem is still missing. In this paper, we provide a unified approach to LDA, and investigate the SSS problem in the framework of statistical learning theory. In such a unified approach, our analysis results in a deeper understanding of LDA. We demonstrate that LDA (and its nonlinear extension) belongs to the same framework where powerful classifiers such as support vector machines (SVMs) are formulated. In addition, this approach allows us to establish an error bound for LDA. Finally our experiments validate our theoretical analysis results.
Design and Performance Evaluation of an Adaptive Parity Cache Technique
Authors: Jungho Huh
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

This research proposes adaptive parity cache technique on cache to solve "small write problem" of RAID 5 especially in OLTP environments. This configuration provides a cache management method that adds information on the read/write characteristics of the file when a user process in RAID 5 makes a request to kernel for a file. This information is used for management of disk cache by reading the parity. Especially on write request, this method reduces additional access problems compared to conventional methods by using write related information of the file system to store data and parity together in a cache. Therefore, we can enhance the cache utilization and improve the disk request response time. Our method is analyzed mathematical method. Comparing with previous works, we observed performance enhancement.
Unsupervised evidence integration
Authors: Philip M. Long, Vinay Varadan, Sarah Gilman, Mark Treshock, Rocco A. Servedio
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Many biological propositions can be supported by a variety of different types of evidence. It is often useful to collect together large numbers of such propositions, together with the evidence supporting them, into databases to be used in other analyses. Methods that automatically make preliminary choices about which propositions to include can be helpful, if they are accurate enough. This can involve weighing evidence of varying strength.We describe a method for learning a scoring function to weigh evidence of different types. The algorithm evaluates each source of evidence by the extent to which other sources tend to support it. The details are guided by a probabilistic formulation of the problem, building on previous theoretical work. We evaluate our method by applying it to predict protein-protein interactions in yeast, and using synthetic data.
Impact of Configurability and Extensibility on IPSec Protocol Execution on Embedded Processors
Authors: Nachiketh R. Potlapally, Srivaths Ravi, Anand Raghunathan, Ruby B. Lee, Niraj K. Jha
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Security protocols, such as IPSec and SSL, are being increasingly deployed in the context of networked embedded systems. The resource-constrained nature of embedded systems and, in particular, the modest capabilities of embedded processors make it challenging to achieve satisfactory performance while executing security protocols. A promising approach for improving performance in embedded systems is to use application-specific instruction set processors that are designed based on configurable and extensible processors. In this work, we perform a comprehensive performance analysis of the IPSec protocol on a state-of-the-art configurable and extensible embedded processor (Xtensa from Tensilica, Inc.). We present performance profiles of a lightweight embedded IPSec implementation running on the Xtensa processor, and examine in detail the various factors that contribute to the processing latencies, including cryptographic and protocol processing. In order to improve the efficiency of IPSec processing on embedded devices, we then study the impact of customizing an embedded processor by synergistically (a) configuring architectural parameters, such as instruction and data cache sizes, processor-memory interface width, write buffers, etc., and (b) extending the base instruction set of the processor using custom instructions for both cryptographic and protocol processing. Our experimental results demonstrate that upto 6X speedup in IPSec processing is possible over a popular embedded IPSec software implementation.
On the effects of loose causal consistency in mobile multiplayer games
Authors: Angie Chandler, Joe Finney
Venue: Proceedings of 4th ACM SIGCOMM workshop on Network and system support for games (2005)

It is well understood that distributed multiplayer games, as soft real-time systems, require a degree of support from the underlying network in order to function correctly, in terms of predictable end to end bandwidth, latency and jitter. In a mobile environment, such applications face even greater challenges, as the latency of wireless networks is much higher than their wireline counterparts, jitter is often much higher due to network handoff and bandwidth is at a premium. In fact, the latency of many wide area wireless networks is beyond the tolerance of most multiplayer games, rendering such applications unusable.This paper presents the design and experimental evaluation of Rendezvous, a novel decentralized consistency management mechanism that enables the collaboration of multiple players in mobile real-time games, even in a high latency environment. The operation of the mechanism is validated through the analysis of a real world example - a distributed mobile multiplayer soccer game called Knockabout, which is designed to operate on the Smartphone platform. Experimental results are included not only comparing Rendezvous to an existing consistency mechanism, but also measuring the length of network delay tolerated by the platform and its effect on the players.
Load Balancing Routing in Multi-Channel HybridWireless Networks with Single Network Interface
Authors: Jungmin So, Nitin H. Vaidya
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

A hybrid wireless network is an extension to an infrastructure network, where a mobile host may connect to an access point using multi-hop wireless routes, via other mobile hosts. The access points are configured to operate on one of multiple available channels. Mobile hosts and wireless routers can select its operating channel dynamically through channel switching. In this environment, we propose a routing protocol that finds routes to balance load among channels while maintaining connectivity. The protocol works with nodes equipped with a single network interface, which distinguishes our work with other multi-channel routing protocols that require multiple interfaces per node. The protocol discovers multiple routes to multiple access points, possibly operating on different channels. Based on traffic load information, each node selects the "best" route to an access point, and synchronizes its channel with the access point. With this behavior, the channel load is balanced, removing hot spots and improving channel utilization. The protocol assures every node has at least one route to an access point, where all intermediate nodes are operating on the same channel. Our simulation results show that the proposed protocol successfully adapts to changing traffic conditions and improves performance over a singlechannel protocol and a multi-channel protocol with no load balancing.
Persona-and-Scenario Based Requirements Engineering for Software Embedded in Digital Consumer Products
Authors: Mikio Aoyama
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

The challenge of the requirements engineering to digital consumer products lies in that the users are unknown many of wide variety. The major contributions of this article include a technique to identify persona to provide a rich contextual model of a group of primary targeted users based on conjoint analysis theory, and a technique to identify the value and hot spots in the requirements through the interaction analysis between personas and scenarios. We applied the proposed methodology to mobile phone product lines through a series of field studies conducted with more than 150 users from 2003 to 2004 in Japan. The studies revealed the various aspects of non-technical users, and proved the effectiveness of proposed methodology in the requirements engineering for digital consumer products.
Robust H∞ control for discrete-time fuzzy systems via basis-dependent Lyapunov functions
Authors: Shaosheng Zhou, Gang Feng, James Lam, Shengyuan Xu
Venue: Information Sciences: an International Journal (2005)

This paper deals with the robust H∞ control problem for a class of discrete-time fuzzy systems with uncertainty. The uncertainty is assumed to be of structured linear fractional form. By using basis-dependent Lyapunov function, an H∞ control design approach is developed. The control design approach is facilitated by introducing some additional instrumental matrix variables. These additional matrix variables decouple the Lyapunov and the system matrices, which makes the control design feasible. The proposed approach leads to some sufficient results in the form of strict linear matrix inequalities (LMIs). It is expected that the basis-dependent results are less conservative than the basis-independent ones due to the introduction of basis-dependent Lyapunov function. Finally, numerical examples including the discrete chaotic Lorenz system are also given to demonstrate the applicability of the proposed approach.
A Model and Algorithm for Out-Sourcing Planning
Authors: Xiao LIU, Chengen WANG, Xiaochuan LUO, Dingwei WANG
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

This paper addresses a dynamic lot-sizing model with outsourcing. All the unsatisfied demands are out-sourced without backlogging, where the inventory capacity is limited and shortages are prohibited. Costs are concave and time va ying. Some new properties are obtained in an optimal solution and a dynamic programming algorithm is developed to solve the problem in strongly polynomial time.
The privacy cost of the second-chance offer
Authors: Sumit Joshi, Yu-An Sun, Poorvi L. Vora
Venue: Proceedings of the 2005 ACM workshop on Privacy in the electronic society (2005)

This paper examines a generalization of a two-stage game common on eBay: an ascending-price auction followed by price discrimination (the second chance offer). High bids in the auction lead to high price offers during price discrimination, and a financial disadvantage in the second stage. The disadvantage depends on (a) the amount of information revealed to the seller in the first stage, and hence the extent of privacy protection provided and (b) whether the bidder is non-strategic (ignores the possibility of price discrimination) or rational. A privacy cost of one mechanism over another is defined and studied.For the non-strategic bidder, the second chance offer provides a zero payoff. Addition of privacy protection (anonymity and bid secrecy) decreases revenue and increases expected payoff, with higher bidders benefiting more. Privacy protection can, however, decrease an individual bidder's payoff by shielding potential buyers from the seller and thus causing an opportunity loss.If the bidder is rational, price discrimination results in a lower revenue than consecutive auctions, and is a bad strategy for the seller. Additionally, rational behavior provides more advantage to the bidder than does anonymity protection.
A Simple and Efficient Method for Global Handwritten Word Recognition Applied to Brazilian Bankchecks
Authors: Luan Ling Lee, Stela Isernhagen Coelho
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

A simple and efficient method for the recognition of isolated handwritten words in Brazilian bankchecks is proposed. For this end, the global word recognition technique was adopted. It relies mainly on topological features to identify the shape of the digitized word images. A Genetic Algorithm (GA) was used to select those features that best represent each word class and the Nearest Neighbor Method was used as a classification means. The experimental results obtained in our laboratory present a higher average classification rate than a previous work that used the same database.
Another approach to a GPSS final examination
Authors: Harold Joseph Highland
Venue: ACM SIGSIM Simulation Digest (1976)

Preparing a final examination in a modeling and simulation course is always a problem for me since I am never satisfied with the results. I am not certain if the students 'memorized' different terms and procedures or have a realistic view of the subject. Last year, I faced the same problem when teaching a fourth year-graduate course in conceptual modeling for the Computer Science Department at Hofstra University.
Why dependent types matter
Authors: James McKinna
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

Language designers have in recent years proposed a wealth of richer type systems for programming which seek to extend the range of statically enforced guarantees on data and code. Most such proposals have been evolutionary extensions of ML or Haskell, offering programmers a balanced compromise between expressive strength and existing well-understood technology. Typically they revolve around type- or kind-indexed types such as GADTs, supported by limited equality reasoning at the type-checking level, thus separating the dynamic behaviour of programs from the (simpler) static behaviour of indexing information occurring in their types.I want to argue in this talk for a more radical departure from such practice by examining full spectrum type dependency, lifting such restrictions on the data upon which types may depend. Conor McBride and I designed the language EPIGRAM for experiments in programming with inductive families of data (of which GADTs are a special case). Using it for illustration, I will explore some of the possibilities and challenges afforded by full spectrum type dependency at the static and dynamic level: types directly support modelling complex invariants in terms of other data (rather than their types), with a Curry-Howard flavour of data-as-evidence; such complexity is on a 'pay-as-you-go' basis, while keeping type annotations and other syntactic overheads to a minimum; data decomposition steps, e.g. case analysis, furnish more informative interactions between types and values during typechecking; such steps may moreover be abstractly specified by their types, and thus user definable; this supports a style of programming embracing 'learning by testing', views, and Burstall's 'hand simulation plus a little induction'; the absence of a rigid phase distinction need not lead to type-passing or excessive run-time overhead; effectful computation, in particular partiality, can be incorporated via variations on existing ideas such as monads.This talk is based on joint work with Conor McBride, Edwin Brady and Thorsten Altenkirch.
A Lightweight Mutual Authentication Protocol for RFID Networks
Authors: Zongwei Luo, Terry Chan, Jenny S. Li
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Radio frequency identification (RFID) technology is expected to become an important and ubiquitous infrastructure technology of supply chain processes and customer service. The low-cost tag, or so-called passive tag, will be likely the factor for widespread adoption of the technology. It must be noticed that the deployment of such tags may create new threats to user privacy due to the powerful tracking capability of the tags. As a result, some sort of security issues must be imposed on the passive tags for addressing the privacy problem. However, providing security in such tags is a challenging task because they are highly resource constrained and cannot support strong cryptography. This paper provides both discussion on the requirements and restrictions of security implementation of a RFID system. It also examines the features and issues pertinent to several existing RFID security solution. Finally, this paper suggests the use of our proposed lightweight security protocol based on Ohkubo [1]'s scheme, which protects user privacy using a hash chain mechanism and also provides an analysis of the protocol.
Development of Grid Middleware CyberGRIP and Its Applications
Authors: Kimio Miyazwa, Yoshimasa Kadooka, Tomonori Yamashita, Toshiyuki Suzuki, Yoshio Tago
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

Recently, there have been demands for greater functional diversity and higher performance in the information technology infrastructure. As a result, the complexity and scale of product design in the product development phase have increased. In addition, development periods need to be reduced so products can be marketed sooner. These requirements have rapidly increased the need to simulate and analyze efficiently in order to achieve optimum designs and verification. At the same time, the needs to do massive simulations effectively become large to avoid the risks in financial business. To satisfy these requirements, there are some technical issues to be solved. For this purpose, CyberGRIP has been developed as grid problem solving environments to realize the virtualization of heterogeneous distributed computing resources. This paper describes the detail explanation of CyberGRIP, its concrete applications and results for the product development in manufacturing industries and for the currency option in financial business.
Naive Bayes models for probability estimation
Authors: Daniel Lowd, Pedro Domingos
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Naive Bayes models have been widely used for clustering and classification. However, they are seldom used for general probabilistic learning and inference (i.e., for estimating and computing arbitrary joint, conditional and marginal distributions). In this paper we show that, for a wide range of benchmark datasets, naive Bayes models learned using EM have accuracy and learning time comparable to Bayesian networks with context-specific independence. Most significantly, naive Bayes inference is orders of magnitude faster than Bayesian network inference using Gibbs sampling and belief propagation. This makes naive Bayes models a very attractive alternative to Bayesian networks for general probability estimation, particularly in large or real-time domains.
From shaman to IT guru
Authors: R. H. Barbour
Venue: ACM SIGCAS Computers and Society (2005)

IT people are involved in creating order out of chaos and communicating new knowledge. IT academics and practitioners find themselves confronted on a daily basis with chaos, un-controlled change and more or less ordered change as new machines, software tools and techniques appear and have to be integrated into existing systems. Dealing with these challenges requires people who are knowledge seekers and problem solvers by inclination, endlessly curious on behalf of other people. This paper addresses the issue of where the role of knowledge seeker and problem solver developed in human history. Parallels are drawn between knowledge seekers in academic cultures and those in First Nation people's cultures. Three aspects of the experiences of past and present knowledge seekers are identified and examined. The first aspect is the initiation of new entrants, the second is the confirmation of acceptance by the group and the third is the vocation of being a knowledge seeker and problem seeker in the IT industry. Metaphor is used to identify these experiences linking together the crucial steps in the processes of becoming accepted as a knowledge seeker. The investigation finds close relationships between First Nations' knowledge seeker's roles and Information Technology roles.
Functional Verification of Pipelined Processors: A Case Study
Authors: Prabhat Mishra, Nikil Dutt, Yaron Kashai
Venue: Proceedings of the Fifth International Workshop on Microprocessor Test and Verification (2004)

Functional verification of pipelined processors is one of the major bottlenecks in current System-on-Chip (SOC) design methodology. A significant bottleneck in the validation of such systems is the lack of a suitable functional coverage metric. This paper presents a test generation and functional coverage estimation framework for pipelined processors using Specman Elite. We have applied this methodology on a VLIW DLX architecture to demonstrate the usefulness of our approach.