ppxscal/embedding_network huggingface dataset:
Permeable Observations of Multifactor Database for Transcription Network
Authors: Miho Sera, Hisayoshi Zaima, Kazuho Ikeo, Takashi Gojobori
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

Systems biology is a research field where experimental and computational approaches are used in combination. Core experimental data tends to be multi-dimensional and large-scale. Consequently, the requirements for data processing are sensitive and intricate. Multiple data whose nature is not the same are difficult to deal with computationally, and dealing with a large amount of data that may not be of high quality is also difficult. We dealt with such complex data using a data analysis pipeline and show that transcription networks are a promising theme of systems biology.
Une approche pour une continuit&eacute; de service pour les utilisateurs de terminaux mobiles
Authors: Nicolas Le Sommer, Hervé Roussain
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

In this paper, we present an approach to provide owners of mobile devices with ubiquitous services. This approach relies on a context-aware deployment of adaptive services on mobile devices and on the collaboration of these devices. These services are designed to provide all (or a part) of the functionalities of the services offered by infrastructure networks equipped with a wireless extension. This approach aims at cutting off from the connection constraints binding mobile devices to the access points of infrastructure networks, and thus to make it possible to use services autonomously. In this paper, we also present the platform we have implemented in order to validate our approach and some examples of adaptive services that have been deployed on it.
On the Three Threshold Policy in the Multi-Server Queueing System with Vacations
Authors: Zhe George Zhang
Venue: Queueing Systems: Theory and Applications (2005)

In this paper, we study an M/M/c queue with a three threshold vacation policy denoted by (e, d, N). With such a policy, the servers keep serving the customers until the number of idle servers reaches d and then e of d servers start taking a vacation together. These e servers keep taking vacations until the number of customers in the system is at least N at a vacation completion instant, then the e servers return to serve the queue again. Using the matrix analytic method, we obtain the stationary performance measures and prove the conditional stochastic decomposition properties for the waiting time and queue length. This model is a generalization of previous multi-server vacation models and offers a useful performance evaluation and system design tool in multi-task server queueing systems.
Survivability Architecture of a Mission Critical System: The DPASA Example
Authors: Jennifer Chong, Partha Pal, Michael Atigetchi, Paul Rubel, Franklin Webber
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

Many techniques and mechanisms exist today, some COTS, others less mature research products that can be used to deflect, detect, or even recover from specific types of cyber attacks. None of them individually is sufficient to provide an all around defense for a mission critical distributed system. A mission critical system must operate despite sustained attacks throughout the mission cycle, which in the case of military systems, can range from hours to days. A comprehensive survivability architecture, where individual security tools and defense mechanisms are used as building blocks, is required to achieve this level of survivability. We have recently designed a survivability architecture, which combined elements of protection, detection, and adaptive reaction; and applied it to a DoD information system. The resulting defense-enabled system was first evaluated internally, and then deployed for external Red Team exercise. In this paper we describe the survivability architecture of the system, and explain the rationale that motivated the design.
Fast Algorithm for Mining Item Profit in Retails Based on Microeconomic View
Authors: Xu Xiujuan, Jia Lifeng, Wang Zhe, Zhou Chunguang, Zhang Hongyan, Liang Shuang
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

The microeconomic framework for data mining assumes that an enterprise chooses a decision maximizing the overall utility over all customers. In item selection problem, the store wants to select J item set S that maximizes the overall profit. Based on the microeconomic view, we propose a novel algorithm ItemRank to solve the problem of item selection with the consideration of cross-selling effect which has two major contributions. First, we propose customer behavior model, and demonstrate it with the data of customer-oriented business. Second, we propose the novel algorithm ItemRank which is implemented on the basis of customer behavior model. According to the cross-selling effect and the self-profit of items, ItemRank algorithm could solve the problem of item order objectively and mechanically. We conduct detailed experiments to evaluate our proposed algorithm and experiment results confirm that the new methods have an excellent ability for profit mining and the performance meets the condition which requires better quality and efficiency.
A Novel Intelligent Textile Technology Based on Silicon Flexible Skins
Authors: Rakesh B. Katragadda, Yong Xu
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

This paper reports the prototype development of a novel intelligent textile technology based on the integration of silicon flexible skins with regular textiles. This novel approach enables the embedding of sensing and computational components into textiles without compromising the flexibility and wearability of the textiles. Silicon flexible skins have been successfully fabricated using micromachining techniques. A prototype of intelligent textiles has been realized by stitching a silicon flexible skin onto a piece of KEVLAR fabric. Preliminary tests have demonstrated excellent durability of the prototype.
Robust Resource Allocations in Parallel Computing Systems: Model and Heuristics
Authors: Vladimir Shestak, Howard Jay Siegel, Anthony A. Maciejewski, Shoukat Ali
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

This is an overview of the material to be discussed in the invited keynote presentation by H. J. Siegel; it summarizes our research in [2, 16, and 17]. The resources in parallel computer systems (including heterogeneous clusters) should be allocated to the computational applications in a way that maximizes some system performance measure. However, allocation decisions and associated performance prediction are often based on estimated values of application and system parameters. The actual values of these parameters may differ from the estimates; for example, the estimates may represent only average values, the models used to generate the estimates may have limited accuracy, and there may be changes in the environment. Thus, an important research problem is the development of resource management strategies that can guarantee a particular system performance given such uncertainties. To address this problem, we have designed a model for deriving the degree of robustness of a resource allocation-the maximum amount of collective uncertainty in system parameters within which a userspecified level of system performance (QoS) can be guaranteed. The model will be presented and we will demonstrate its ability to select the most robust resource allocation from among those that otherwise perform similarly (based on the primary performance criterion). The model's use in allocation heuristics also will be demonstrated. This model is applicable to different types of computing and communication environments, including parallel, distributed, cluster, grid, Internet, embedded, and wireless.
Socially aware media
Authors: Alex (Sandy) Pentland
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Face-to-face communication conveys social context as well as words, and it is this social signaling that allows new information to be smoothly integrated into a shared, group-wide understanding. By building machines that understand social signaling and social context we can begin to make communication tools that keep remote users 'in the loop,' and can dramatically improve collective decision making.
Active Document Layout Synthesis
Authors: Xiaofan Lin
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Document layout analysis has been researched for many years. However, there is little work on the reverse of document layout analysis: document layout synthesis, whose goal is to generate logically correct and aesthetically appealing layout given the text/image contents and the flexible layout template. This paper introduces a new automatic document layout synthesis method, which can actively pursue the optimal text block height-width tradeoff simultaneously with the block position adjustment. The key idea is to use a cluster of linear functions to approximate the nonlinear heightwidth curve. Then two-pass Simplex algorithm is used to solve the layout synthesis problem. This method has a wide range of applications, such as Variable Data Printing (VDP), automatic table formatting, and automating document layout ground truth generation.
iCDMdt: Focused the Model Mapping and Performance Optimization in Embedded System Design
Authors: Jing Luan, Xuan Cheng, Junzhong Gu
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

This paper proposes a method of model-driven HW/SW co-design in embedded system design and discusses the key technology of model mapping, automatic generating codes and performance optimization. Using the developed iCDMdt platform, a series of design tasks can be integrative fulfilled, such as modeling, mapping from DCDM to systecC model, generating executable systemC codes and co-verifying in different abstract levels. After performance optimizing, the virtual prototype that offers for lowlevel chops design is gained. This can shorten the design time of product. Finally, an instance of application is introduced.
Alamouti-Based Space-Frequency Coding for OFDM
Authors: Andreas A. Hutter, Selim Mekrazi, Beza N. Getu, Fanny Platbrood
Venue: Wireless Personal Communications: An International Journal (2005)

We investigate space-frequency block coding for OFDM systems with multiple transmit antennas, where coding is applied in the frequency domain (OFDM carriers) rather than in the time domain (OFDM symbols). In particular we consider Alamouti's code, which was shown to be the optimum block code for two transmit antennas and time domain coding. We show that the standard decoding algorithm results in significant performance degradation depending on the frequency-selective nature of the transmission channels, such that a low coherence bandwidth results in a huge degradation. The optimum decoding algorithm that alleviates this problem is the maximum-likelihood decoder for joint symbol detection. We present a performance analysis for the investigated space-frequency decoders in terms of the achievable BER results. Furthermore we compare space-time and space-frequency coding and discuss the respective advantages and drawbacks of the different decoding algorithms in terms of their complexity. It should be noted that for the space-time approach we introduce the so-called matched-filter receiver, which shows significantly lower complexity compared to the maximum-likelihood decoder known from literature. The HIPERMAN system serves as an example OFDM system for quantitative comparisons.
Exploiting Dynamic Querying like Flooding Techniques in Unstructured Peer-to-Peer Networks
Authors: Hongbo Jiang, Shudong Jin
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

In unstructured peer-to-peer networks, controlled flooding aims at locating an item at the minimum message cost. Dynamic querying is a new controlled flooding technique. While it is implemented in some peer-to-peer networks, little is known about its undesirable behavior and little is known about its general usefulness in unstructured peerto- peer networks. This paper describes the first evaluation and analysis of such techniques, and proposes novel techniques to improve them. We make three contributions. First, we find the current dynamic querying design is flawed. Although it is advantageous over the expanding ring algorithm in terms of search cost, it is much less attractive in terms of peer perceived latency, and its strict constraints on network connectivity prevent it from being widely adopted. Second, we propose an enhanced flooding technique which requires the search cost close to the minimum, reduces the search latency by more than four times, and loosens the constraints on the network connectivity. Thus, we make such techniques useful for the general unstructured peer-to-peer networks. Third, we show that our proposal requires only minor modifications to the existing search mechanisms and can be incrementally deployed in peer-to-peer networks.
Risk assessment in distributed authorization
Authors: Peter Chapin, Christian Skalka, X. Sean Wang
Venue: Proceedings of the 2005 ACM workshop on Formal methods in security engineering (2005)

Distributed authorization takes into account several elements, including certificates that may be provided by non-local actors. While most trust management systems treat all assertions as equally valid up to certificate authentication, realistic considerations may associate risk with some of these elements; some actors may be less trusted than others, some elements may be more computationally expensive to obtain, and so forth. Furthermore, practical online authorization may require certain levels of risk to be tolerated. In this paper, we introduce a trust management logic that incorporates formal risk assessment. This formalization allows risk levels to be associated with authorization elements, and promotes development of a distributed authorization algorithm allowing tolerable levels of risk to be precisely specified and rigorously enforced.
Challenges and Solutions for Model Driven Web Service Composition
Authors: Konrad Pfadenhauer, Burkhard Kittl, Schahram Dustdar
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

System theory propagates the use of models which raise the level of abstraction to cope with complexity, evolving out of variety and connectivity. Different modeling techniques have been invented for the abstract description of certain aspects of dynamic system behaviour. Nowadays process models are also an accepted part of service oriented process design. Although service oriented architecture (SOA) is the aim, rather isolated processes are the starting point for executable code generation and not the changing functionality distribution the system offers. Thus we claim the system view, necessary for process lifecycle management, is missing. Moreover, in the context of Web Service Composition, a vertical, bi- directional model driven approach allows for manifold allocation of e.g. testing, validation or binding tasks within the layer stack of MDAs (model driven architecture). In this paper we discuss two distinctive proposals for model driven service composition, followed by a comparison of representative mapping scenarios offered by IBM and Microsoft.
Discourses on computer integration at a botswana junior secondary school
Authors: Ellen Brantlinger
Venue:  (2005)

Since the introduction of computers in Botswana's junior secondary schools no comprehensive study has ever been undertaken to find out how the teachers, students, parents and education officers perceived these technological innovation, or how the teachers integrated computer technology into their teaching. In this dissertation research, I studied various technological discourses to find out how the different stakeholders perceived computer integration. I conducted interviews, made observations, and analyzed some instructional documents. I transcribed all the interviews and subsequently coded them using the NUDIST computer program. I enumerated the observation data to determine the frequency of (i) the teachers' and students' visits to the laboratory and (ii) their usage of the available computer software. I also searched and recorded all the sentences, phrases, and words related to computer technology and usage contained in the teachers' instructional documents in order to determine the way the teachers planned to use the computers in their teaching. One thing that I found out was that computer integration at Bokang JSS was implemented, and continued to run, without a technology policy. The absence of a technology policy contributed to some of the computer integration problems at the school including inadequate training of teachers and marginalization of some stakeholders. Some of the teachers were discontented because of the dearth of computer resources and poor management of the computer laboratory. Despite these hurdles, the attitudes of the teachers, students, and parents toward computers and computer usage were generally positive. Finally, I found that the female teachers and female students at Bokang JSS made more visits to the computer laboratory and used computers more than their male counterparts. This is contrary to the belief that female persons are more anxious to use computers than male persons.
Functional Principles of Registry-based Service Discovery
Authors: V. Sundramoorthy, P. H. Hartel, J. I. den Hartog, J. Scholten, C. Tan
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

As Service Discovery Protocols (SDP) are becoming increasingly important for ubiquitous computing, they must behave according to predefined principles. We present the functional Principles of Service Discovery for robust, registry-based service discovery. A methodology to guarantee adherence to these principles is provided and illustrated by formal verification of the principles against FRODO, an SDP built for the home environment. We show that, to make behavioral guarantees, an SDP has to be robust against network disturbances, and cannot rely only on the network layer.
Finding Spatio-Temporal Patterns in Climate Data Using Clustering
Authors: Mohd. Noor Md. Sap, A. Majid Awan
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

This paper presents a method for unsupervised partitioning of data for finding spatio-temporal patterns in climate data using kernel methods which offer strength to deal with complex data non-linearly separable in input space. This work gets inspiration from the notion that a non-linear data transformation into some high dimensional feature space increases the possibility of linear separability of the patterns in the transformed space. Therefore, it simplifies exploration of the associated structure in the data. Kernel methods implicitly perform a non-linear mapping of the input data into a high dimensional feature space by replacing the inner products with an appropriate positive definite function. In this paper we present a robust weighted kernel k-means algorithm incorporating spatial constraints for clustering climate data. The proposed algorithm can effectively handle noise, outliers and auto-correlation in the spatial data, for effective and efficient data analysis by exploring patterns and structures in the data.
Authoring and User Interaction for the Production of Wave Field Synthesis Content in an Augmented Reality System
Authors: Frank Melchior, Tobias Laubach, Diemer de Vries
Venue: Proceedings of the 4th IEEE/ACM International Symposium on Mixed and Augmented Reality (2005)

Wave field synthesis (WFS) enables the accurate reproduction of a sound field for a large listening area with correct characteristics for each listener position. An exact perspective on the synthesized wave field is provided for every listener. Therefore, WFS-technology is ideally suited to be combined with augmented reality systems, where every user perceives his own visual perspective of a given scene. This paper presents a concept for authoring and user interaction for the production of wave field synthesis content in an augmented reality system. Also, the implementation of a prototype WFS-AR System based on ARToolkit is explained.
SPIN-TEST: automatic test pattern generation for speed-independent circuits
Authors: Feng Shi, Y. Makris
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

SPIN-TEST is a simulation-based gate-level ATPG system for speed-independent circuits. Its core engine is an A* search algorithm which employs an accurate fault simulator and an efficient cost function to guide a deterministic test pattern generation phase. A random test pattern generation phase is also available in order to improve run time. The key ATPG challenge in speed-independent circuits is the generation of patterns that are valid independently of the relative timing and the order of arrival of signals. SPIN-TEST addresses this challenge by guaranteeing fault sensitization with hazard/race-free patterns and response observation that is not affected by oscillations or non-deterministic circuit states. Experimental results on benchmark circuits demonstrate the efficiency of SPIN-TEST in terms of both high fault coverage and low test generation time.
Design and evaluation of a voting tool in a collaborative environment
Authors: Murray Turoff, Starr Roxanne Hiltz
Venue:  (2003)

This dissertation research designed, implemented, and evaluated a Web-based Dynamic Voting Tool for small group decision-making in a collaborative environment. In this dissertation, the literature on voting tools in current GDSS research is presented. Various voting theories and methods are analyzed, and the advantages and weaknesses are compared, so as to gain a better understanding of how to apply these different voting methods to diverse decision-making situations. A brief overview of scaling theories is also given, with an emphasis on Thurstone's Law. The basic features of some web-based voting tool implementations are reviewed along with a discussion of the pros and cons of Internet voting. A discussion of Human Dynamic Voting (HDV) follows; HDV allows multiple voting and continuous feedback in a group process. The Dynamic Voting Tool designed and developed by the author (i.e., Zheng Li) integrated multiple scaling and voting methods, and supported dynamic voting. Its features, user feedback, and future improvements are further discussed. A controlled experiment was conducted to evaluate the effects of the Dynamic Voting Tool (along with the List Gathering Tool by Yuanqiong Wang) interacting with small group process. The design and procedures of the experiment, and the data analysis results extracted from 187 student subjects from New Jersey Institute of Technology are reported. While the System Survey yielded very positive feedback on the voting tool, the hypotheses tested by the Post-Questionnaire and expert judgments showed no major positive significant results. This was probably due to the complexity of the task and procedures, lack of motivation of the subjects, bad timing, insufficient training, and uneven distribution of subjects, etc. Several field studies using the Social Decision Support System (SDSS) Toolkit (List Gathering Tool + Dynamic Voting Tool) are presented. The SDSS system worked well when the subjects were motivated. The field studies show that the toolkit can be used in course evaluations, or other practical applications. Finally, it is suggested that future research can focus on improving the voting tool with true dynamic features, exploring more issues on SDSS systems design and experimentation, and exploring the relationship of voting and GSS.