ppxscal/embedding_network huggingface dataset:
Process Data Mining Based on Rough-set Time Series Analysis
Authors: Guijun Yang
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

This paper proposed Process Data Mining method based on the Rough set time series analysis based on Rough set theory. In this article the theory of rough set and the basic concepts of data mining are introduced firstly, and then the characteristics and main steps on the process data mining method based on rough set are also introduced. Using the data mining method proposed in this paper, the main drawbacks of the traditional rough set in time series data mining can be eliminated. We also explained the feasibility and the key issues in practice of the process data mining based on rough set theory.
Reliability and Dependability Analysis for Agent-Based Reliability Enhancement Technology (ARET) System
Authors: Qiang Guan, Seung-Soo Han
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

As a general rule for evaluating dependability of a system, reliability and dependability is commonly considered which barely pays attention to the stability of system components. This means that estimation does not deal with mis-operation caused by environment and operation in SAS (Substation Automation System). In this paper an integrated reliability and dependability analysis is proposed to analyze SAS (Substation Automation System). With absorbing continuous time Markov process, the analysis can be well applied to estimate and quantify system robustness. In this research, the analysis applied to the actually implemented, dual system and newly proposed IEC61850-based backup system, named ARET (Agent-based Reliability Enhancement Technology) system. Comparative analysis has shown that: By introducing the standard of IEC61850 into the system, not only the system dependability was promoted, but also the system reliability was enhanced greatly.
MUTE-AES: a multiprocessor architecture to prevent power analysis based side channel attack of the AES algorithm
Authors: Jude Angelo Ambrose, Sri Parameswaran, Aleksandar Ignjatovic
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Side channel attack based upon the analysis of power traces is an effective way of obtaining the encryption key from secure processors. Power traces can be used to detect bitflips which betray the secure key. Balancing the bitflips with opposite bitflips have been proposed, by the use of opposite logic. This is an expensive solution, where the balancing processor continues to balance even when encryption is not carried out in the processor. We propose, for the first time, a multiprocessor algorithmic balancing technique to prevent power analysis of a processor executing an AES cryptographic program, a popular encryption standard for embedded systems. Our technique uses a dual processor architecture where two processors execute the same program in parallel, but with complementary intermediate data, thus balancing the bitflips. The second processor works in conjunction with the first processor for balancing only when the AES encryption is performed, and both processors carry out independent tasks when no encryption is being performed. Accessing the encryption key or the input data by the first processor begins the obfuscation by the second processor. To stop the encryption by the second processor, we use a novel signature detection technique, which detects the end of the encryption automatically. The multiprocessor balancing approach (MUTEAES) proposed here reduces performance by 0.42% and increases the size of the hardware by 2X (though reduces to 0.1% when no encryption is being performed). We show that Differential Power Analysis (DPA) fails when our technique is applied to AES. We further illustrate, that by the use of this balancing strategy, the adversary is left with noise from the power profile with little useful information.
Digital Watermark Algorithm Based on Embedding Gray Image into Color Image
Authors: Jing-wei Gao, Jian-guo Li
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Recently, as the fast development of the computer network communication technology, it’s more and more convenient for the digital information storage and transmission. Therefore, more and more attention is focused on the copyright protection of digital information. An algorithm that gray image as watermark is embedded in original color-image is introduced. This algorithm thinks over both unobtrusiveness and robustness, and the size of image is unlimited. So it has strongly practical significance.
The personal tour planning engine based on genetic algorithm
Authors: Chuanchang Liu, Junliang Chen
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

The personal tour planning is to select tour elements for tourists from the tour integrated-information database according to their tour requirements, then to plan the tour time table according to the tour elements selected. In this paper, the personal tour planning is divided into two steps: the fist one is to choose tour elements, which is modeled by transforming into the 0-1 knapsack problem and resolved by the greedy algorithm-based genetic algorithm; the second one is to choose a tour route according the tour elements chosen, which is modeled by transforming into the degree-constrained multi-objective minimum spanning tree and resolved by the spanning tree-based genetic algorithm. Simulation results prove the method is able to deal with the personal tour planning problem.
Convergence and limit of mean-value analysis algorithms
Authors: Ágnes Bogárdi-Mészöly, Tihamér Levendovszky, Hassan Charaf, Ágnes Szeghegyi
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The performance of information systems is one of the most important and complicated consideration. Performance metrics can be predicted with the help of a proper performance model and an appropriate evaluation algorithm. In our work, the Mean-Value Analysis evaluation algorithm is enhanced based on the investigation of thread pools. With the enhanced performance evaluation algorithm the performance metrics of multi-tier information systems can be predicted much more accurate. In addition, the enhanced algorithm is experimentally validated. The goal of our work is the convergence and limit analysis of the original and the enhanced algorithms.
The multipurpose batch station (MBS) system: software design
Authors: Clemens B. Hergenhan, Mark M. Rochkind
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

In 1971, Bell Laboratories undertook the development of a minicomputer based batch terminal system primarily to support remote computing activities at its many locations. The effort was to result in a high performance, cost effective system which could be used to improve upon an array of specialized terminals leased from a variety of vendors. In addition to functioning as a conventional remote batch terminal, the system, known now as the Multipurpose Batch Station (MBS), was to serve as an interlocation data link, as a local media conversion station and as a generalized communications interface between large central computers and foreign vendor peripherals. In terms of communications support, the MBS System was to accommodate synchronous disciplines, either 2-wire or 4-wire, at bit per second rates from 2,000 to at least 50,000. The system was to be interrupt driven and was to optimize thru-put for voice grade channels.
Linear constraint graph for floorplan optimization with soft blocks
Authors: Jia Wang, Hai Zhou
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

In this paper, we propose the Linear Constraint Graph (LCG) as an efficient general floorplan representation. For n blocks, an LCG has at most 2n+3 vertices and at most 6n+2 edges. Operations with direct geometric meanings are developed to perturb the LCGs. We apply the LCGs to the floorplan optimization with soft blocks to leverage its advantage in terms of the sizes of the graphs, which will improve the efficiency of solving a complex mathematical program in the inner loop of the optimization that decide the block shapes without introducing overlaps to the non-slicing floorplans. Experimental results confirm that the LCGs are effective and efficient.
An improved representation for evolving programs
Authors: M. S. Withall, C. J. Hinde, R. G. Stone
Venue: Genetic Programming and Evolvable Machines (2009)

A representation has been developed that addresses some of the issues with other Genetic Program representations while maintaining their advantages. This combines the easy reproduction of the linear representation with the inheritable characteristics of the tree representation by using fixed-length blocks of genes representing single program statements. This means that each block of genes will always map to the same statement in the parent and child unless it is mutated, irrespective of changes to the surrounding blocks. This method is compared to the variable length gene blocks used by other representations with a clear improvement in the similarity between parent and child. In addition, a set of list evaluation and manipulation functions was evolved as an application of the new Genetic Program components. These functions have the common feature that they all need to be 100% correct to be useful. Traditional Genetic Programming problems have mainly been optimization or approximation problems. The list results are good but do highlight the problem of scalability in that more complex functions lead to a dramatic increase in the required evolution time.
Internet-based system for anti-tumor chemotherapy evaluation
Authors: D. Klimes, M. Kubasek, R. Smid, L. Dusek
Venue: Computer Methods and Programs in Biomedicine (2009)

The Internet-based system DIOS addresses the issues of anti-tumor chemotherapy and its evaluation. The repository of chemotherapeutic regimens (CHRs) stored in XML structured format constitutes the core of the system. Several applications have been created based on this repository, in order to allow users to browse current CHRs and procedures of planning and evaluation of chemotherapy based on the dose intensity concept. This freely available system uses technology based on the XML standard and XSLT transformations.
Gaussian process dynamic programming
Authors: Marc Peter Deisenroth, Carl Edward Rasmussen, Jan Peters
Venue: Neurocomputing (2009)

Reinforcement learning (RL) and optimal control of systems with continuous states and actions require approximation techniques in most interesting cases. In this article, we introduce Gaussian process dynamic programming (GPDP), an approximate value function-based RL algorithm. We consider both a classic optimal control problem, where problem-specific prior knowledge is available, and a classic RL problem, where only very general priors can be used. For the classic optimal control problem, GPDP models the unknown value functions with Gaussian processes and generalizes dynamic programming to continuous-valued states and actions. For the RL problem, GPDP starts from a given initial state and explores the state space using Bayesian active learning. To design a fast learner, available data have to be used efficiently. Hence, we propose to learn probabilistic models of the a priori unknown transition dynamics and the value functions on the fly. In both cases, we successfully apply the resulting continuous-valued controllers to the under-actuated pendulum swing up and analyze the performances of the suggested algorithms. It turns out that GPDP uses data very efficiently and can be applied to problems, where classic dynamic programming would be cumbersome.
Predictable Path Establishment in Multimedia Communication Networks
Authors: Robert Simon
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Deadline-driven packet scheduling policies provide highly flexible methods for real-time communication support of distributed multimedia applications. This paper presents a probabilistic approach for analyzing admission control and communication establishment for the general class of non-preemptive deadline-oriented packet scheduling policies. The prediction method can be used for communication and scheduling policy evaluation, routing for multimedia traffic, and capacity planning. A large-scale simulation study demonstrates that our method provides highly accurate predictions of acceptance rates for multiple types of multimedia connection requests.
Plenary lecture II: adopting agile software project management practices: success factors, changes required, and challenges
Authors: Subhas C. Misra
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

Agile software development (ASD) is an emerging approach in software engineering, initially proposed and promoted by a group of seventeen software professionals who practice a set of "lightweight" methods, and share a common set of values of software development. They consolidated their thoughts, and defined these methods as "agile". The approaches are based on experiences and best practices from the past by the above-mentioned group of seventeen software professionals. ASD practices give importance to development around motivated individuals, give them the freedom and flexibility to make them productive, and "think outside of the box". The agile philosophy believes in project implementation around motivated individuals. Motivated individuals should be provided the environment, and support needed for them to make them successful. As an emerging approach of this century, agile software development has undergone limited number of empirical studies. In this keynote lecture, I advance the state-of-the-art of the research in this area by conducting survey-based ex-post-facto empirical (quantitative) studies by identifying the success factors from the perspective of software practitioners in agile software development projects. In this keynote lecture, I also suggest a ranked list of changes required and challenges involved in adopting agile software development methodologies by projects practicing plan-driven software development.
Ant Colony Optimization Algorithms for Shortest Path Problems
Authors: Sudha Rani Kolavali, Shalabh Bhatnagar
Venue: Network Control and Optimization: Second Euro-NF Workshop, NET-COOP 2008 Paris, France, September 8-10, 2008. Revised Selected Papers (2009)

We propose four variants of a recently proposed multi-timescale algorithm in [1] for ant colony optimization and study their application on a multi-stage shortest path problem. We study the performance of the various algorithms in this framework. We observe that one of the variants consistently outperforms the algorithm in [1].
Query rewriting for detection of privacy violation through inferencing
Authors: Vikram Goyal, S. K. Gupta, Shobhit Saxena
Venue: Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services (2006)

When a privacy violation is detected the intension behind the violation is revealed. We refer to this as a malafide intension and the information revealed as the target. The target can be expressed using an SQL-like syntax. In sophisticated privacy attacks the target of the attack may not have been directly accessed but inferred from other pieces of information by exploiting functional dependencies present in the application domain. In this paper we present an efficient algorithm to rewrite the malafide intension query attributes which will return the minimal set of attribute from which the target can be derived. The attribute sets returned by algorithm can derive the target using functional dependencies (algorithm is sound) and furthermore if any minimal set can derive the target using functional dependencies then it will be returned by the algorithm (algorithm is complete).
A sampling-based scheduling method for distributed computing
Authors: Jifang Li
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

In this paper, we propose a new solution for dynamic task scheduling in distributed environment. We argue that a function is existed in the items: execution time, the size of data and the algorithm, therefore we can deduce the execution time of a data mining task from the corresponding the size of data and algorithm. We adopt the sampling method for process the tasks scheduling in distributed data mining environment. The experimental results show the sampling method is applicable to task scheduling in dynamic environment and can be adopted to obtain a higher result.
Introducing skip mode in distributed video coding
Authors: Stefaan Mys, Jürgen Slowack, Jozef Škorupa, Peter Lambert, Rik Van de Walle
Venue: Image Communication (2009)

Although it was proven in the 1970s already by Wyner and Ziv and Slepian and Wolf that, under certain conditions, the same rate-distortion boundaries exist for distributed video coding (DVC) systems as for traditional predicting systems, until now no practical DVC system has been developed that even comes close to the performance of state-of-the-art video codecs such as H.264/AVC in terms of rate-distortion. Some important factors for this are the lower accuracy of the motion estimation performed at the decoder, the inaccurate modeling of the correlation between the side information and the original frame, and the absence in most state-of-the-art DVC systems of anything conceptually similar to the notion of skipped macroblocks in predictive coding systems. This paper proposes an extension of a state-of-the-art transform domain residual DVC system with an implementation of skip mode. The skip mode has an impact at two different places: in the turbo decoder, more specifically the soft input, soft output (SISO) convolutional decoder, and in the puncturing of the parity bits. Results show average bitrate gains up to 39% (depending on the sequence) achieved by combining both approaches. Furthermore, a hybrid video codec is presented where the motion estimation task is shifted back to the encoder. This results in a drastic increase in encoder complexity, but also in a drastic performance gain in terms of rate-distortion, with average bitrate savings up to 60% relative to the distributed video codec. In the hybrid video codec, smaller but still important average bitrate gains are achieved by implementing skip mode: up to 24%.
Animation Generation Process for Sign Language Synthesis
Authors: M. Delorme, M. Filhol, A. Braffort
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

In this paper, we propose a new process for Sign Language synthesis. Our approach is based on a geometric description of signs to animate a signing avatar. We work as follows: the signs are divided in timing units and treated separately in a sequential process. The final results are merged into a global animation file describing the whole sign in terms of articulatory angles for a skeleton.
A reconfigurable VLSI architecture for a database processor
Authors: Kemal Oflazer
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

This work brings together the processing potential offered by regularly structured VLSI processing units and the architecture of a database processor---the Relational Associative Processor (RAP). The main motivations are to integrate a RAP cell processor on a few VLSI chips and improve performance by employing procedures exploiting these VLSI chips and the system level reconfigurability of processing resources. The resulting VLSI database processor consists of parallel processing cells that can be reconfigured into a large processor to execute the hard operations of projection and semijoin efficiently. It is shown that such a configuration can provide 2 to 3 orders of magnitude of performance improvement over previous implementations of the RAP system in the execution of such operations.
Data Replication Using Experience Based Trust in a Data Grid Environment
Authors: Shaik Naseera, T. Vivekanandan, K. V. Madhu Murthy
Venue: Proceedings of the 5th International Conference on Distributed Computing and Internet Technology (2008)

High availability is the desirable feature of the data in a data grid. The data is replicated in a data grid to increase the data availability, reliability and improve the response time of the applications by reducing the network traffic. The efficiency and fast access to such replicated data are influenced by the location of the resource holding the replica and the access cost. The replica locations may be some times unreliable and there is a risk that the resources may fail and hence fail to provide the guaranteed QoS. The notion of trust is to manage such risk and improve the QoS provided by the resource locations. In this paper we apply the concept of experience based trust to the problem of data replication in a data grid environment. We proposed different trust-based replica location selection algorithms and evaluated their effectiveness for a simulated grid. The aim of this work is to identify and to acquire the most available, least loaded and the fastest resource as a replica location.
Wireless image sensor networks: event acquisition in attack-prone and uncertain environments
Authors: Alexandra Czarlinska, Deepa Kundur
Venue: Multidimensional Systems and Signal Processing (2009)

Wireless Image Sensor Networks (WISNs) consisting of untethered camera nodes and sensors may be deployed in a variety of unattended and possibly hostile environments to obtain surveillance data. In such settings, the WISN nodes must perform reliable event acquisition to limit the energy, computation and delay drains associated with forwarding large volumes of image data wirelessly to a sink node. In this work we investigate the event acquisition properties of WISNs that employ various techniques at the camera nodes to distinguish between event and non-event frames in uncertain environments that may include attacks. These techniques include lightweight image processing, decisions from n sensors with/without cluster head fault and attack detection, and a combination approach relying on both lightweight image processing and sensor decisions. We analyze the relative merits and limitations of each approach in terms of the resulting probability of event detection and false alarm in the face of occasional errors, attacks and stealthy attacks.
New Wireless Communication Platform for Home Automation - Case Study
Authors: Radek Kuchta, Radimir Vrba, Vladimir Sulc
Venue: Proceedings of the 2009 Third International Conference on Digital Society (2009)

This paper describes main features of IQRF wireless communication platform for home automation. This platform was developed and designed for home and industrial automation. Some basic functions of OS, development tools and basic modules are described. A case study is discussed at the end of the paper. This is a case study of a sensor network created around a core coordinator and a set of temperature wireless units.