ppxscal/embedding_network huggingface dataset:
Heat Map Visualizations Allow Comparison of Multiple Clustering Results and Evaluation of Dataset Quality: Application to Microarray Data
Authors: John Sharko, Georges G. Grinstein, Kenneth A. Marx, Jianping Zhou, Chia-Ho Cheng, Shannon Odelberg, Hans-Georg Simon
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Since clustering algorithms are heuristic, multiple clustering algorithms applied to the same dataset will typically not generate the same sets of clusters. This is especially true for complex datasets such as those from microarray time series experiments. Two such microarray datasets describing gene expression activities from regenerating newt forelimbs at various times following limb amputation were used in this study. A cluster stability matrix, which shows the number of times two genes appear in the same cluster, was generated as a heat map. This was used to evaluate the overall variation among the clustering algorithms and to identify similar clusters. A comparison of the cluster stability matrices for two related microarray experiments with different levels of precision was shown to be an effective basis for comparing the quality of the two sets of experiments. A pairwise heat map was generated to show which pairs of clustering algorithms grouped the data into similar clusters.
Mobile & Wireless Business Applications in the Italian Utility Market: an Empirical Study and a Decision Model
Authors: Andrea Rangone, Filippo Renga, Paolo Catti, Flavia Mitrione, Christian Mondini
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

Mobile & Wireless Business applications are a musthave for 21st century Enterprises that use innovative business models and available technologies to supply mobility to their employees and to control business activities in real time. This real time control of distribution and production plants is essential for Utility Companies, in order to obtain the multiple benefits deriving from the implementation of Mobile & Wireless Business applications. This paper's aim is to determine the available applications and their impacts on the internal processes of a Utility Company, thus giving a framework to support the generation and choice of the different options. The model is based on empirical research carried out in many of the major Italian Utility Companies; the research analyzed the decisional process and the main impacts of the implemented applications, such as Automated Meter Management, Field Force Automation and Remote Control.
Balancing Cost, Operation and Performance in Integrated Hydrogen Hybrid Energy System
Authors: N. N. Barsoum, P. Vacent
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

This paper shows the way to design the aspects of a hybrid power system that will target remote users. It emphasizes on the hydrogen hybrid power system to obtain a reliable autonomous system with the optimisation of the components size and the improvement of the capital cost. This system is chosen to provide electricity for a small and remote located community. A methodology is developed for calculating the correct size of the system and for optimizing the management. The main power for the hybrid system comes from the photovoltaic panels, while the fuel cell and secondary batteries are used as backup units. The optimization software used for this paper is the Hybrid Optimization Model for Electric Renewables (HOMER). HOMER is a design model that determines the optimal architecture and control strategy of the hybrid system. It can also determine the sensitivity of the outputs to changes in the inputs. It performs an hourly time series analysis on each of hundreds or thousands of different system configurations
Trust and Recommendations in Mobile Ad hoc Networks
Authors: Venkat Balakrishnan, Vijay Varadharajan, Udaya Kiran Tupakula, Phillip Lucs
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Recently several trust and reputation models have been proposed to enhance the security of mobile ad hoc networks. In these models, recommendations are circulated by forwarding explicit messages or introducing extra message headers. Apart from incurring additional overhead, the recommendations are prone to issues such as recommender's bias, honest-elicitation, and free-riding. In this paper, we propose a trust model to enhance the security of mobile ad hoc networks and to address the issues related to recommendations. The model uses only trusted routes for communication, and isolates malicious nodes depending on the evidence collected from direct interactions and recommendations. It deploys a novel approach for communicating recommendations such that they are free from recommender's bias, honestelicitation, and free-riding. Simulation results confirm the effectiveness of our model.
A Survey and Analysis of the P3P Protocol's Agents, Adoption, Maintenance, and Future
Authors: Ian K. Reay Patricia Beatty Scott Dick
Venue: IEEE Transactions on Dependable and Secure Computing (2007)

In this paper, we survey the adoption of the Platform for Privacy Preferences Protocol (P3P) on Internet Web sites to determine if P3P is a growing or stagnant technology. We conducted a pilot survey in February 2005 and our full survey in November 2005. We compare the results from these two surveys and the previous (July 2003) survey of P3P adoption. In general, we find that P3P adoption is stagnant, and errors in P3P documents are a regular occurrence. In addition, very little maintenance of P3P policies is apparent. These observations call into question P3P's viability as an online privacy-enhancing technology. Our survey exceeds other previous surveys in our use of both detailed statistical analysis and scope; our February pilot survey analyzed more than 23,000 unique Web sites, and our full survey in November 2005 analyzed more than 100,000 unique Web sites.
Bayesian classification of a human custom based on stochastic context-free grammar
Authors: Humikazu Mitomi, Fuyuki Fujiwara, Masanobu Yamamoto, Taisuke Sato
Venue: Systems and Computers in Japan (2007)

This paper describes a new approach for gesture recognition based on stochastic context-free grammar (SCFG). We focus on the actions in the Japanese tea ceremony, where structure of the action can be described by context-free grammar. Our aim is to recognize the actions in the tea ceremony. Existing SCFG approach consists of generating symbol stream, parsing, and recognition. The symbol stream often includes uncertainty. Therefore, the parsing process needs to recover from errors in the entry process. This paper proposes an error-free approach to segment an action into a set of events. This approach, based on acceleration of body motion, can produce events corresponding to a terminal symbol with little error. After translating the events into a set of symbol streams, parsing the set of the streams leaves a small number to be derived. The number of potential streams is not too large since each event is correctly segmented. Among the remaining streams, our SCFG can identify the action with a maximum posterior probability. Giving an SCFG rule the multiple probabilities, one SCFG can recognize multiple actions. &copy; 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(9): 52&ndash;62, 2007; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20531
On the limits of speech recognition in noise
Authors: S. D. Peters
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

We consider the performance of speech recognition in noise and focus on its sensitivity to the acoustic feature set. In particular, we examine the perceived information reduction imposed on a speech signal using a feature extraction method commonly used for automatic speech recognition. We observe that the human recognition rates on noisy digit strings drop considerably as the speech signal undergoes the typical loss of phase and loss of frequency resolution. Steps are taken to ensure that human subjects are constrained in ways similar to that of an automatic recognizer. The high correlation between the performance of the human listeners and that of our connected digit recognizer leads us to some interesting conclusions, including that typical cepstral processing is insufficient to support speech information in noise.
Optimality of multiple entropy coder systems for nonstationary sources modelled by a mixture distribution
Authors: J. M. Lervik
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

A mixture distribution model is introduced to characterize the source statistics in a frequency domain image coder. More specifically, a Gaussian mixture distribution is shown to be a good statistical model of the probability density function of the composite decomposed signal. Theoretical results based on the mixture distribution model are found that quantify the obtainable entropy rate gain in the coder when using multiple entropy coders. A practical image coder using the theoretical concepts is proposed. The simulation results show close correspondence with the predicted theoretical results, thus, verifying the accuracy of the mixture distribution model.
Development of a 3D-CAD add-in for tolerance analysis and synthesis in micro systems (/spl mu/-ToAST)
Authors: C. Germer, U. Hansen, H.-J. Franke, S. Buttgenbach
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

The Institutes for Engineering Design and for Microtechnology at the Technical University of Braunschweig in Germany are developing a software system, which enables engineers to cope with tolerances in the design of complex products. Besides the theoretical background of this software the latest progress in its development is presented in this paper.
On-demand information extraction
Authors: Satoshi Sekine
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

At present, adapting an Information Extraction system to new topics is an expensive and slow process, requiring some knowledge engineering for each new topic. We propose a new paradigm of Information Extraction which operates 'on demand' in response to a user's query. On-demand Information Extraction (ODIE) aims to completely eliminate the customization effort. Given a user's query, the system will automatically create patterns to extract salient relations in the text of the topic, and build tables from the extracted information using paraphrase discovery technology. It relies on recent advances in pattern discovery, paraphrase discovery, and extended named entity tagging. We report on experimental results in which the system created useful tables for many topics, demonstrating the feasibility of this approach.
The dark oracle: perspective-aware unused and unreachable address discovery
Authors: Evan Cooke, Michael Bailey, Farnam Jahanian, Richard Mortier
Venue: Proceedings of the 3rd conference on Networked Systems Design & Implementation - Volume 3 (2006)

Internet traffic destined for unused or unreachable addresses provides critically important information on malicious and misconfigured activity. Since Internet address allocation and policy information is distributed across many devices, applications, and administrative domains, constructing a comprehensive map of unused and unreachable ("dark") addresses is challenging. In this paper, we present an architecture that automates the process of discovering these dark addresses by actively participating with allocation, routing, and policy systems. Our approach is to adopt a local perspective revealing unreachable external addresses and unused private and local addresses, and enabling the detection of threats coming into and out of a network. To validate the approach, we construct a prototype system called the Dark Oracle that uses internal and external routing data and host configuration information, such as DHCP logs, to automatically discover dark addresses. We experimentally evaluate the prototype using data from a large enterprise network, and a regional ISP, and from deployment of the Dark Oracle on a large academic network.
Design and Simulation of a high performance Emergency data delivery Protocol
Authors: Kevin Swartz, Di Wang
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

The purpose of this project was to design a high performance data delivery protocol, capable of delivering data as quickly as possible to a base station or target node. This protocol was designed particularly for wireless network topologies, but could also be applied towards a wired system. An emergency is defined as any event with high priority that needs to be handled immediately. It is assumed that this emergency event is important enough that energy efficiency is not a factor in our protocol. The desired effect is for fast as possible delivery to the base station for rapid event handling.
An adaptive query management technique for real-time monitoring of spatial regions in mobile database systems
Authors: Ying Cai
Venue: Proceedings of the Performance, Computing, and Communications Conference, 2002. on 21st IEEE International (2002)

This paper presents a technique for real-time monitoring of mobile objects in user-defined spatial regions. We refer to such regions as range-monitoring queries. Unlike conventional queries, which are based on an instant of the database at some moment in time, range-monitoring queries are continuous for monitoring purposes. Such queries can last for an extended period of time; and many can be active simultaneously. We present an efficient technique for managing such continuous queries. This capability is not available in conventional database management systems which are designed to manage data, not queries. In our environment, each mobile object is associated with a resident domain and is made aware of the monitoring areas inside it. When an object moves, it monitors its spatial relationship with its known monitoring areas. If it crosses any query boundaries, it reports server and the server updates the affected query results accordingly. When an object moves out of its resident domain, the server will determine a new one for the object. This process is supported efficiently with our new index structure called Domain tree. Our simulation results indicate that our technique is many times better than a recent method in terms of communication cost and server processing cost.
Fast and exact signed Euclidean distance transformation with linear complexity
Authors: O. Cuisenaire
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

We propose a new signed or unsigned Euclidean distance transformation algorithm, based on the local corrections of the well-known 4SED algorithm of Danielsson (1980). Those corrections are only applied to a small neighborhood of a small subset of pixels from the image, which keeps the cost of the operation low. In contrast with all fast algorithms previously published, our algorithm produces perfect Euclidean distance maps in a time linearly proportional to the number of pixels in the image. The computational cost is close to the cost of the 4SSED approximation.
Tools for Model Driven Development
Authors: Liming Zhu, Yan Liu, Ian Gorton, Ihor Kuz
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Model Driven Development (MDD) aims to raise the level of abstraction for software development by providing more powerful concepts for capturing and reusing knowledge in deployment platforms and languages. MDD approaches are gaining a foothold in industrial practice. This is being facilitated by the Object Management Group (OMG), which leads the standards development effort (MDA/MOF/UML) for MDD. Leading software tool vendors such as IBM and Microsoft, as well as many smaller vendors and open source projects, are developing technologies to support MDD. We therefore believe it is timely to explore the current leading research efforts in tools for MDD.
STEP: Sequentiality and Thrashing Detection Based Prefetching to Improve Performance of Networked Storage Servers
Authors: Shuang Liang, Song Jiang, Xiaodong Zhang
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

State-of-the-art networked storage servers are equipped with increasingly powerful computing capability and large DRAMmemory as storage caches. However, their contribution to the performance improvement of networked storage system has become increasingly limited. This is because the client-side memory sizes are also increasing, which reduces capacity misses in the client buffer caches as well as access locality in the storage servers, thus weakening the caching effectiveness of server storage caches. Proactive caching in storage servers is highly desirable to reduce cold misses in clients. We propose an effective way to improve the utilization of storage server resources through prefetching in storage servers for clients. In particular, our design well utilizes two unique strengths of networked storage servers which are not leveraged in existing storage server prefetching schemes. First, powerful storage servers have idle CPU cycles, under-utilized disk bandwidth, and abundant memory space, providing many opportunities for aggressive disk data prefetching. Second, the servers have the knowledge about high-latency operations in storage devices, such as disk head positioning, which enables efficient disk data prefetching based on an accurate cost-benefit analysis of prefetch operations.We present STEP - a Sequentiality and Thrashing dEtection based Prefetching scheme, and its implementation with Linux Kernel 2.6.16. Our performance evaluation by replaying Storage Performance Council (SPC)'s OLTP traces shows that server performance improvements are up to 94% with an average of 25%. Improvements with frequently used Unix applications are up to 53% with an average of 12%. Our experiments also show that STEP has little effect on workloads with random access patterns, such as SPC' Web- Search traces.
Analysing the role of perceived self-efficacy in information processing for Web-based information systems
Authors: Maryam Aziz, R. Macredie
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

From the perspective of individuals' beliefs about their cognitive abilities to process information, understanding the use of Web-based information systems is a big challenge. Ensuring then the competent processing of information, on the basis of users' mental processes and states, guarantees successful use of Web-based information systems. However, this issue becomes critical when users interact with familiar and unfamiliar information systems with varying perceptions of their abilities to use them. These perceptions are translated as users' perceptions of self-efficacy. This paper addresses this issue by proposing an information processing model based on user perceived self-efficacy. The proposed theoretical information processing model is tested and validated in a three-phase empirical study. Useful insights are obtained into individuals' varying perceptions of self-efficacy that account for information processing from the perspective of using familiar and unfamiliar systems separately.
On-line garbage modeling for word and utterance verification in natural numbers recognition
Authors: C. De La Torre
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

On-line garbage modeling techniques have been shown to be a good alternative to traditional explicitly-trained garbage HMMs due to their low computational cost, their independence respect to any garbage training set and to the good results provided in several tasks related with rejection and keyword spotting. We present an extension of this techniques to word, pulse and utterance verification for real continuous speech recognition based applications. The combination of this method with application-dependent knowledge has provided a drastic control on the false alarm rate (down to 3.2%), while maintaining low and balanced performance in terms of string error rate and string rejection rate.
Robust Subspace Position Measurement Using Localized Sub-Windows
Authors: Aart Smit, Derek C. Schuurman
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

The use of localized principal component analysis is examined for visual position determination in the presence of varying degrees of occlusions. Occlusions lead to substantial position measurement errors when projecting images into eigenspace. One way to improve robustness to occlusions is to select small sub-windows so that if some subwindows are occluded, others can still accurately identify position. The location of candidate sub-windows are predetermined from a set of training images by subtracting the average image from each and then selecting regions using an attention operator. Since attention operators can be computationally time-intensive, the location of all sub-windows are determined a-priori during the training phase. The subwindows in each of the training images are then projected into eigenspace. Once the training phase is complete, the run-time execution can be performed efficiently since all the sub-windows have been preselected. Input images are classified by each sub-window; majority voting is then used to determine the position estimate. Various experiments are performed including linear and rotational motion, and the ego motion of a mobile robot. This technique is shown to provide greater position measurement accuracy in the presence of severe occlusions as compared to the projection of entire images.
Consistently Incorporating Changes to Evolve Transition-based Systems
Authors: Mahadevan Subramaniam, Harvey Siy
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

Evolving software-intensive systems from one consistent state to another is a challenging activity due to the intricate inter-dependencies among the components. In this paper, we propose a novel, semantic approach to incorporate software changes while automatically preserving system consistency. Systems are modeled as a network of reactive components whose behaviors are specified by communicating finite state machines extended with finite domain variables. Changes perform addition/ deletion/ replacement of one or more transitions in one or more components. Consistency of a system is modeled in terms of application-independent reachability properties over system global states. The proposed approach takes a change and a consistent system as inputs and automatically synthesizes a set of changes that can be consistently incorporated into the system. Each synthesized change represents a different, alternative evolved system that can be produced from the given system with the input change while minimally modifying the existing behaviors. The proposed approach has been implemented in a prototype semantic change impact analysis system and has been applied to several examples including SDL programs from a commercial telecom switch.