ppxscal/embedding_network huggingface dataset:
Activity Recognition for the Smart Hospital
Authors: Dairazalia Sánchez, Monica Tentori, Jesús Favela
Venue: IEEE Intelligent Systems (2008)

A main challenge in developing ambient-intelligence environments is context recognition. Systems can easily recognize some contextual variables, such as location, but activity recognition is much more complex. The authors describe an approach for estimating activities in a working environment. They used data representing 196 hours of detailed observation of hospital workers to train and test a hidden Markov model. The results indicate that an HMM can correctly estimate user activity 92.6 percent of the time and can outperform neuronal networks and even human observers familiar with the work practices. These results can help augment ambient-intelligence environments in hospitals. This article is part of a special issue on ambient intelligence.
Game-Theoretical Effectiveness Evaluation of DDoS Defense
Authors: Pan Shi, Yifeng Lian
Venue: Proceedings of the Seventh International Conference on Networking (2008)

In the Distributed Denial of Service (DDoS) defense research, rate-limiting methods have been proposed to alleviate the damage of attacks according to different congestion control mechanisms. This paper presents a new game-theoretical methodology to evaluate effectiveness of typical DDoS defense mechanisms quantitatively. A complete strategic game model is constituted for DDoS attack and defense warfare. Besides simulation studies, mixed strategic Nash Equilibrium is computed to analysis and predict DDoS warfare behaviors in the end of the paper. In this model, the comparing performances of congestion control mechanisms such as Aggregated-based Congestion Contro l(ACC) and Pushback are denoted by the results of utility function. At last, probabilistic results are given to conclude and interpret the using and availability of this methodology.
On-Line Network Reachability Analysis Using Forward Information Base Emulation
Authors: Young Dae Kim, Chan Kyou Hwang, Jae Hyoung Yoo
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

This paper presents a new approach of routing protocol management as a first step towards the conception of on-line network reachability analysis. Each individual router has an FIB (Forwarding Information Base), which is a table containing the information required to forward IP packets, which is used for packet delivery. At a minimum, FIB contains the interface identifier and the next hop information for each reachable destination. If it is possible to emulate the FIBs of on-line routers in service, network reachability could be simulated in real time. ‘A destination is reachable’ indicates that the FIB lookup from its source to the destination is successful. This simulation will make it unnecessary to model FIBs and a lookup mechanism, or to analyze the routing information filtering. In this paper, a mean of FIB emulation and network reachability simulation through the analysis of routing information are shown. This method is valuable, both for network users and operators.
Perceived directionality of 1/f&beta; noise surfaces
Authors: Pratik Shah, Stefano Padilla, Patrick Green, Mike Chantler
Venue: Proceedings of the 5th symposium on Applied perception in graphics and visualization (2008)

We are investigating the perceived characteristics of 3D surface texture by using rendered images of synthetic surfaces with precisely defined characteristics. We compute texture features directly from the height data and present observers with animated images that mimic the way in which people rotate surface textures when assessing their characteristics. This both eliminates illumination induced bias and provides observers with rich, realistic stimuli.
Business-to-business electronic market place selection
Authors: J. Guo
Venue: Enterprise Information Systems (2007)

There is an increasing demand for doing business online, which calls for higher business interoperability on business-to-business (B2B) electronic market places (EMp). This drives the development of integration technologies for improving B2B electronic market (EM) functions on EMp. This paper argues that with the development of integration technologies companies will use more private, community and public EMp and select their proper type of EMp when comparing the function-cost ratios of business interoperability on different types of B2B EMp. This argument has been validated through the case studies against a method of historical event analysis. In this shift, four integration factors of standard flexibility, enterprise integration, service provision and semantic integration are constantly improving EMp functions, which lead to an overall reduction of interaction cost for business interoperation on all types of EMp. This will change business behaviour and corporate strategies of most firms, and have important implications for firms to make strategies of how to select EMp to increase business interoperability for higher competitiveness.
Motion design and learning of autonomous robots based on primitives and heuristic cost-to-go
Authors: Keyong Li, Raffaello D'Andrea
Venue: Robotics and Autonomous Systems (2008)

The task of trajectory design of autonomous vehicles is typically two-fold. First, it needs to take into account the intrinsic dynamics of the vehicle, which are sometimes termed local constraints. Second, on a higher level, the designed trajectories must allow the vehicle to achieve some application-specific task. The specification of the task results in the so-called global constraints. Both of these two components of trajectory design are generally nontrivial problems, and very often, they are pursued as two parallel areas. When the results drawn from the two areas are applied in conjunction, the synthesis is usually somewhat arbitrary. In this paper, we assume that some optimal control laws are available as a set of motion primitives to address the vehicle dynamics. The trajectories that achieve the task are determined solely through the primitives and do not reference the vehicle dynamics directly. For the higher level, we translate the task into a very special type of cost-to-go function, which is partially specified artificially and partially determined by an admissibility condition imposed by the set of primitives. The optimality feature of the primitives is formally extended to the final trajectory design. We illustrate this result with the example of a mobile robot retrieving an object, which is an interesting problem of its own right. Both a direct design approach and a learning approach are presented.
Knowledge Management in Modern Organizations
Authors: Murray E. Jennex
Venue:  (2007)

"Knowledge management has been growing in importance and popularity as a research topic and business initiative. Knowledge Management in Modern Organizations documents the latest key issues of knowledge management. The innovative chapters in this book discuss the philosophical foundations of knowledge management, serving as a viable resource for academicians, practitioners, researchers, and students. Knowledge Management in Modern Organizations depicts a global perspective as the contributors come from Asia, Europe, the Middle East, and the United States, and adds value to any course focused on KM in organizations."
Performance evaluation of an IEEE 802.15.4 sensor network with a star topology
Authors: Chandramani Kishore Singh, Anurag Kumar, P. M. Ameer
Venue: Wireless Networks (2008)

One class of applications envisaged for the IEEE 802.15.4 LR-WPAN (low data rate--wireless personal area network) standard is wireless sensor networks for monitoring and control applications. In this paper we provide an analytical performance model for a network in which the sensors are at the tips of a star topology, and the sensors need to transmit their measurements to the hub node so that certain objectives for packet delay and packet discard are met. We first carry out a saturation throughput analysis of the system; i.e., it is assumed that each sensor has an infinite backlog of packets and the throughput of the system is sought. After a careful analysis of the CSMA/CA MAC that is employed in the standard, and after making a certain decoupling approximation, we identify an embedded Markov renewal process, whose analysis yields a fixed point equation, from whose solution the saturation throughput can be calculated. We validate our model against ns2 simulations (using an IEEE 802.15.4 module developed by Zheng [14]). We find that with the default back-off parameters the saturation throughput decreases sharply with increasing number of nodes. We use our analytical model to study the problem and we propose alternative back-off parameters that prevent the drop in throughput. We then show how the saturation analysis can be used to obtain an analytical model for the finite arrival rate case. This finite load model captures very well the qualitative behavior of the system, and also provides a good approximation to the packet discard probability, and the throughput. For the default parameters, the finite load throughput is found to first increase and then decrease with increasing load. We find that for typical performance objectives (mean delay and packet discard) the packet discard probability would constrain the system capacity. Finally, we show how to derive a node lifetime analysis using various rates and probabilities obtained from our performance analysis model.
OPTIMAL ADAPTIVE CONTROLLER FOR MULTIDIMENSIONAL ARMAX MODEL
Authors: Rui Jiang, Kueiming Lo
Venue: Cybernetics and Systems (2007)

The objective of this paper is to find an adaptive control strategy which would enable us to estimate the parameters of the ARMAX model as accurately as possible, along with consuming less controlling energy, while keeping the output of the system below a specified level of variability. Using the self-tuning tracker, this paper establishes global convergence of a stochastic adaptive control algorithm for discrete linear system, and the adaptive controller may converge to the one-step-ahead optimal controller at the same time.
Operation of the Core D-Grid Infrastructure
Authors: Thomas Fieseler, Wolfgang Gürich
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

D-Grid is a German implementation of a grid, granted by the German Federal Ministry of Education and Research. In this paper we present the Core D-Grid which acts as a condensation nucleus to build a production grid infrastructure. The main difference compared to other international grid initiatives is the support of three middleware systems, namely LCG/gLite, Globus, and UNICORE for computeresources. Storage resources are connected via SRM/dCache and OGSA-DAI. In contrast to homogeneous communities, the partners in Core D-Grid have different missions and backgrounds (computing centers, universities, research centers), providing heterogeneous hardware from single processors to high performance supercomputing systems with different operating systems. We present methods to integrate these resources and services for the D-Grid infrastructure like a point of information, centralized user and virtual organization management, resource registration, software provisioning, and policies for the implementation (firewalls, certificates, user mapping).
Guest Editors' Introduction: Progress in Test Compression
Authors: Scott Davidson, Nur A. Touba
Venue: IEEE Design Test (2008)

This special issue represents a snapshot of the progress in test compression, a key strategy for dealing with rapidly growing test data volume. Test compression involves encoding test data in a compressed form so that less data needs to be transferred, thereby reducing test time and the need for tester memory. A wide variety of test compression techniques have been developed, both for compressing test vectors and compressing output responses. In recent years, several researchers and companies have developed compression methods and products that achieve significant amounts of compression. These new methods have extended the life of legacy ATE and have been synergistic with the need for additional tests to detect the defects arising in nanometer designs. Thus, test compression continues to be a very active area.
Brief paper: Adaptive IIR/FIR fusion filter and its application to the INS/GPS integrated system
Authors: Seong Yun Cho, Byung Doo Kim
Venue: Automatica (Journal of IFAC) (2008)

Motivated by the complementary features of the IIR-type filter and the FIR-type filter, this paper proposes a robust IIR/FIR fusion filter and an INS/GPS integrated system designed with the fusion filter. In the fusion filter, an IIR-type filter (SPKF) and a FIR-type filter (MRHKF filter) are processed independently, and then the two filters are merged using the mixing probability calculated using the residuals and residual covariance information of the two filters. The merits of the SPKF and the MRHKF filter are integrated and the demerits of the filters are diminished through the filter fusion. Consequently, the proposed fusion filter shows robustness against model uncertainty, temporary disturbing noise, large initial estimation error, etc. The stability of the fusion filter is verified by showing the closeness of two filters in the mixing/redistribution process and the upper bound of the error covariance matrices. This fusion filter is applied to an INS/GPS integrated system. The performance of the INS/GPS integrated system designed using the fusion filter is verified through a simulation under various error environments and is experimentally confirmed.
High Capacity Steganographic Method Based Upon JPEG
Authors: Adel Almohammad, Robert M. Hierons, Gheorghita Ghinea
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

The two most important aspects of any image-based steganographic system are the quality of the stego-image and the capacity of the cover image. This paper proposes a novel and high capacity steganographic approach based on Discrete Cosine Transformation (DCT) and JPEG compression. JPEG technique divides the input image into non-overlapping blocks of 8x8 pixels and uses the DCT transformation. However, our proposed method divides the cover image into non-overlapping blocks of 16x16 pixels. For each quantized DCT block, the least two-significant bits (2-LSBs) of each middle frequency coefficient are modified to embed two secret bits. Our aim is to investigate the data hiding efficiency using larger blocks for JPEG compression. Our experiment result shows that the proposed approach can provide a higher information-hiding capacity than Jpeg-Jsteg and Chang et al. methods based on the conventional blocks of 8x8 pixels. Furthermore, the produced stego-images are almost identical to the original cover images.
A fast algorithm for numerical solutions to Fortet's equation
Authors: Gorazd Brumen
Venue: Journal of Computational and Applied Mathematics (2008)

A fast algorithm for computation of default times of multiple firms in a structural model is presented. The algorithm uses a multivariate extension of the Fortet's equation and the structure of Toeplitz matrices to significantly improve the computation time. In a financial market consisting of M@?1 firms and N discretization points in every dimension the algorithm uses O(nlogn.M.M!.N^M^(^M^-^1^)^/^2) operations, where n is the number of discretization points in the time domain. The algorithm is applied to firm survival probability computation and zero coupon bond pricing.
Assisting Elders with Mild Dementia Staying at Home
Authors: Daqing Zhang, Mossaab Hariz, Mounir Mokhtari
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Elders with mild dementia exhibit impairments of memory, thought and reasoning. It has been recognized that pervasive computing technologies can assist those suffering from mild dementia to improve their level of independence and quality of life through cognitive reinforcement. In this paper, we present a user-centred design approach, which is based on the iterative process of user study, prototyping, user testand evaluation, to achieve the goal of developing a cost-effective cognitive prosthetic device with associated services for elders with mild dementia. Specifically, we describe the results of user study in three different test sites, four areas of cognitive reinforcement have been identified to assist their independent living. Of different assistive services, we choose two context-aware reminding services as a case study to illustrate how to deploy pervasive computing techniques in the system design. Finally, we present the overall system architecture and initial system implementation with first trial results.
A survey on algorithms for mining frequent itemsets over data streams
Authors: James Cheng, Yiping Ke, Wilfred Ng
Venue: Knowledge and Information Systems (2008)

The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of frequent itemsets (FIs). Unlike mining static databases, mining data streams poses many new challenges. In addition to the one-scan nature, the unbounded memory requirement and the high data arrival rate of data streams, the combinatorial explosion of itemsets exacerbates the mining task. The high complexity of the FI mining problem hinders the application of the stream mining techniques. We recognize that a critical review of existing techniques is needed in order to design and develop efficient mining algorithms and data structures that are able to match the processing rate of the mining with the high arrival rate of data streams. Within a unifying set of notations and terminologies, we describe in this paper the efforts and main techniques for mining data streams and present a comprehensive survey of a number of the state-of-the-art algorithms on mining frequent itemsets over data streams. We classify the stream-mining techniques into two categories based on the window model that they adopt in order to provide insights into how and why the techniques are useful. Then, we further analyze the algorithms according to whether they are exact or approximate and, for approximate approaches, whether they are false-positive or false-negative. We also discuss various interesting issues, including the merits and limitations in existing research and substantive areas for future research.
Computational steering on distributed systems: Indoor comfort simulations as a case study of interactive CFD on supercomputers
Authors: Petra Wenisch, Christoph van Treeck, André Borrmann, Ernst Rank, Oliver Wenisch
Venue: International Journal of Parallel, Emergent and Distributed Systems (2007)

This paper presents the current state of a computational steering system for interactive computational fluid dynamics (CFD) simulations, allowing engineers to simulate interactively indoor climate and to evaluate human comfort. The tools presented support cooperative planning and design by providing means for interactively adding, removing and modifying geometry and boundary conditions online during a CFD simulation. To ensure interactivity and short-latency updates even for high-resolution runs the parallel Lattice-Boltzmann-based simulation kernel is optimized for high-performance computing systems. Emphasis is placed on the computational steering architecture, connecting a supercomputer with one or more visualization workstations. In particular, we show how a high-performance communication between simulation and visualization or steering front-end can be achieved together with preserving a flexible mechanism of on-the-fly attachment of multiple cooperation clients.
Equipment life time optimization with respect to operational expenses
Authors: N. V. Lubkov
Venue: Automation and Remote Control (2008)

The subject of investigations is the equipment operational model, where the operational expenses are represented by planned replacement expenses and losses due to failures. The two replacement strategies are considered: "planned replacement at the end of predetermined life time or after a failure" and "planned replacement at the end of predetermined life time." In the second case only working capacity is restored after failure. The optimal lifetime value is shown to depend on the ratio of planned replacement expenses and losses due to failure. The rated conditions for the optimal equipment lifetime and for the gamma-percentile life are obtained providing the distribution of time to failure is determined by the Weibull law. The expediency of the equipment group replacement is discussed.
Development Platforms for Flash Memory Solid State Disks
Authors: Hongseok Kim, Eyee Hyun Nam, Ki Seok Choi, Yoon Jae Seong, Jin-yong Choi, Sang Lyul Min
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

In this paper, we explain the basics of flash memory technology in general and solid state disks in particular, and describe development platforms specifically designed for flash memory solid state disks.
Correlating user profiles from multiple folksonomies
Authors: Martin N. Szomszor, Iván Cantador, Harith Alani
Venue: Proceedings of the nineteenth ACM conference on Hypertext and hypermedia (2008)

As the popularity of the web increases, particularly the use of social networking sites and style sharing platforms, users are becoming increasingly connected, sharing more and more information, resources, and opinions. This vast array of information presents unique opportunities to harvest knowledge about user activities and interests through the exploitation of large-scale, complex systems. Communal tagging sites, and their respective folksonomies, are one example of such a complex system, providing huge amounts of information about users, spanning multiple domains of interest. However, the current Web infrastructure provides no mechanism for users to consolidate and exploit this information since it is spread over many desperate and unconnected resources. In this paper we compare user tag-clouds from multiple folksonomies to: (a) show how they tend to overlap, regardless of the focus of the folksonomy (b) demonstrate how this comparison helps finding and aligning the user's separate identities, and (c) show that cross-linking distributed user tag-clouds enriches users profiles. During this process, we find that significant user interests are often reflected in multiple Web2.0 profiles, even though they may operate over different domains. However, due to the free-form nature of tagging, some correlations are lost, a problem we address through the implementation and evaluation of a user tag filtering architecture.