ppxscal/embedding_network huggingface dataset:
State-Based Modeling to Support the Evolution and Maintenance of Safety-Critical Software Product Lines
Authors: Jing Liu, Josh Dehlinger, Hongyu Sun, Robyn Lutz
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

Changes to safety-critical product lines can jeopardize the safety properties that they must ensure. Thus, evolving software product lines must consider the impact that changes to requirements may have on the existing systems and their safety. The contribution of this work is a systematic, tool-supported technique to support safe evolution of product-line requirements using a model-based approach. We show how the potential feature interactions that need to be modeled are scoped and identified with the aid of product-line software fault tree analysis. Further, we show how reuse of the state-based models is effectively exploited in the evolution phase of product-line engineering. To illustrate this approach, we apply our technique to the evolution of a safety-critical cardiac pacemaker product line.
Biorthogonal cosine-modulated filter bank
Authors: T. Q. Nguyen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

Cosine-modulated filter banks have been studied extensively because of their design ease and efficient implementation. These filter banks either have restricted lengths or assume the paraunitary property for the polyphase matrices. In this paper, the biorthogonal cosine-modulated filter bank with arbitrary length is considered and the perfect reconstruction (PR) conditions are derived. These conditions are the general form of the PR conditions reported in the literature. Examples of PR systems with variable overall delay are designed using the quadratic constrained least squares formulation.
Letters: Liquid state machine and its separation ability as function of electrical parameters of cell
Authors: Grzegorz M. Wojcik, Wieslaw A. Kaminski
Venue: Neurocomputing (2007)

Large artificial Hodgkin-Huxley neural networks are examined. The structures discussed in this article simulate a part of the cortex of the mammalian visual system. We use a modular architecture of the cortex divided into sub-regions. Results of parallel simulations based on the liquid computing theory are presented in some detail. Separation ability of groups of neural microcircuits is observed. We check if such property depends on electrical parameters of particular cells. Properties Liquid State Machine's are derived from the types of neurons used for simulations. They are compared and discussed to some extent.
Typical DoS/DDoS Threats under IPv6
Authors: Xinyu Yang, Ting Ma, Yi Shi
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

The DoS/DDoS attacks are always the leading threats to the Internet. With the development of Internet, IPv6 is inevitably taking the place of IPv4 as the main protocol of Internet. So the security issues of IPv6 become the focus of the present research. In this paper we mainly focus on the typical DoS/DDoS attacks under IPv6, which including the DoS attacks pertinent to IPv6 Neighbor Discovery protocol and DDoS attacks based on the four representative attack modes, they are respectively TCP-Flood, UDP-Flood, ICMP-Flood and Smurf. We do these attack experiments under IPv6 with and without IPSec configuration respectively. The experiments without IPSec validate the effectiveness of the typical DoS/DDoS attacks under IPv6, and those with IPSec show the effectiveness of IPSec against these attacks whose source addresses are spoofed.
Automated fault localization with statistically suspicious program states
Authors: Tai-Yi Huang, Pin-Chuan Chou, Cheng-Han Tsai, Hsin-An Chen
Venue: Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems (2007)

A number of fault localization techniques have been developed to reduce the time in manually debugging a faulty program. The technique of code coverage [8] has been recognized by its effectiveness in identifying suspicious statements that may contain the fault. However, a programmer still needs to manually examine each variable referenced in a suspicious statement and such a process can become extremely time-consuming if this suspicious statement is part of a loop. In this paper, we propose a novel technique called state coverage to significantly reduce the time in examining variables. We first insert a set of checkpoints to record the state of each variable referenced in a branching statement. We next execute the faulty program by a test suite consisting of both passed and failed cases. A state is statistically considered to be more suspicious if it appears more in failed cases and less in passed cases. We implemented both code coverage and state coverage in a debugging tool and used a commonly-used benchmark consisting of 58 faulty programs to evaluate their performance. For 34% of these programs, their faults are within 20 statement steps of the most suspicious statement identified by code coverage. By adding state coverage and breaking at the most suspicious state, we increase this ratio to 64%, an 88% performance improvement. Finally, we also explain a few cases in which both state coverage and code coverage cannot perform well.
Model Driven Design of Reliable Robot Control Programs Using the jABC
Authors: Sven Jorges, Christian Kubczak, Felix Pageau, Tiziana Margaria
Venue: Proceedings of the Fourth IEEE International Workshop on Engineering of Autonomic and Autonomous Systems (2007)

Developing robot control applications is a software engineering domain that still relies on low-level development tools with limited testing capabilities. The Java Application Building Center (jABC), a framework for model-based application development that supports the modelling process of service-oriented software applications, on the contrary offers a number of early error detection mechanisms like animation, analysis, simulation, and formal verification. We investigate the adequacy of jABC to model, verify and implement robot control applications in a model driven paradigm, and aim at addressing the design of software for autonomous robots for space missions later on. Being able to model and verify their reconfiguration behaviour before launching them is of central importance there. We developed a proof-of-concept application that controls a Lego® Mindstorms robot which finds its way through a maze. As this maze may change dynamically, the robot must be capable of reacting and adjusting its behaviour. This application was completely modelled, verified, and generated with the jABC.
A Scheduling Architecture for QOS and Temporal Mapping
Authors: Kashinath Basu, Frank Ball
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

This paper presents the development and evaluation of a model for mapping the Quality of Service (QoS) requirements and traffic characteristics of aggregated IP traffic flows belonging to multiple classes of continuous media (Audio and Video) sources onto a single ATM Virtual Channel (VC) that is also shared with a number of IP data classes. This model was developed as part of a wider range of research activity focused on supporting QoS in future IP networks. The model presented in this paper offers improvements on an earlier model that used an "idealized" scheduler and was validated only for homogeneous continuous media sources. The paper discusses the improved scheduling mechanism that can minimize the effects of imperfections in cell level scheduling and presents a simulation experiment to validate the new model for aggregated heterogeneous continuous media sources.
Nonuniform sampling in magnetic resonance imaging
Authors: F. T. A. W. Wajer
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This paper concerns reconstruction of MR images from raw, nonuniformly sampled k-space data. The exposed methods are (1) gridding, which resamples to a uniform rectangular grid and works well in the absence of undersampling; and (2) Bayesian estimation, which can accommodate undersampling.
Multiobjective optimization using dynamic neighborhood particle swarm optimization
Authors: Xiaohui Hu, R. Eberhart
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper presents a particle swarm optimization (PSO) algorithm for multiobjective optimization problems. PSO is modified by using a dynamic neighborhood strategy, new particle memory updating, and one-dimension optimization to deal with multiple objectives. Several benchmark cases were tested and showed that PSO could efficiently find multiple Pareto optimal solutions.
Active Peer to Peer
Authors: XueLian Lin, Jinpeng Huai, Xudong Liu, Jun Han
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Peer to peer is an important way for files sharing. In existing P2P systems, users need to query and retrieve files, and have to know some knowledge, such as file names, keywords or hash values, about those files before searching. However, files on the Internet are not only abundant but also mutable. It's rather difficult for users to determine how, and at what frequency to query. This paper presents a P2P system named Active P2P, which is different from current P2P systems in that documents will automatically come to peer's storage space users shared after user install this system and connect it to the P2P network. In Active P2P system, users can get the most important files on the Internet without querying, which keeps the difficulties of files locating and searching away from users. To achieve this purpose, the basic idea of this paper is to make the naturally passive files into logically active ones which can compete and cooperate with each other. Winners in the competition can reproduce themselves and possess storage space of more peers while the losers will be died out at a higher probability.
Agent based human behavior modeling: a knowledge engineering based systems methodology for integrating social science frameworks for modeling agents with cognition, personality and culture
Authors: Barry Silverman
Venue:  (2006)

The objective of my dissertation is to develop an integrative process for constructing, validating and refining agent-based models of human behavior, and hence, carrying out human behavior modeling (HBM) in a defensible manner. For lack of a better term and due to extensive involvement of Knowledge Engineering (KE) techniques and construction of the knowledge models, the process will be conveniently referred to as the KE-based process (KE process). The hypothesis is that the KE process will help: (1) systematically transform empirical evidence, tacit knowledge, and expert knowledge into data for modeling; (2) reduce human errors and cognitive biases (e.g. confirmation bias); and (3) verify and validate the model as a whole, and the knowledge base in particular.In order to test the hypothesis, I have employed the KE process to create several models of leaders, followers, crowd members, rebels, and agitators in conflict situations. Next, I have been able to validate my KE process under naturalistic conditions by testing, verifying and validating these models against real world datasets. During the course of the studies, I have integrated existing, but fragmented, frameworks in social science to bring about the behavior of people in social systems. I have demonstrated the process through three case studies. In the validation and discussion sections, I explore how and where correlations between simulated agents versus real characters are improved through the application of the KE process. The conclusions address lessons learned, tools created to help others use the KE process, and steps for future research. The dissertation has demonstrated a process for HBM that could be employed to construct cognitively detailed synthetic agents to be used in such applications as immersive training, analytical support and domain knowledge acquisition. Specifically, the process helps integrate the social science models, structure the value trees and estimate the parameters of the agents, so that these agents make decisions and exhibit behaviors that are realistic.
Latchup effect in CMOS IC: a solution for crypto-processors protection against fault injection attacks?
Authors: N. Buard, F. Miller, C. Ruby, R. Gaillard
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

Latchup is a short-circuit that can be triggered in CMOS ICs when a current pulse is produced by parasitic perturbations. It is usually regarded as very disturbing for reliability, especially in space applications where it is triggered by ionizing particles naturally present in the environment. But in another context, the one of crypto-processors, it could be used as a way to protect the device from attacks by fault injections. Indeed, if all the parts of the ICs containing the secret data have the property to be more sensitive to latchup than to upsets, it will be impossible for attackers to retrieve the key with fault injections attacks. This paper describes how to design a crypto-processor with such features, and how to verify its properties.
Automated Design and Insertion of Optimal One-Hot Bus Encoders
Authors: Peter Wohl, A. Waicukauski, Sanjay Patel
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

Tristate buses, commonly used in high-performance designs, raise testability problems because one-hot conditions, required for functional operation, may not be maintained during scan testing. We present a novel method to automatically generate and insert a bus encoder that ensures one-hot bus operation. Each bus is analyzed individually; a customized encoder is then generated and optimized for best testability and minimal area and delay. We introduce two new bus encoder designs which form the basis of a hierarchically algorithm that scales up to any number of bus inputs.
Maximum likelihood joint estimation of channel and noise for robust speech recognition
Authors: Yunxin Zhao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

An EM algorithm is formulated in the DFT domain for joint estimation of parameters of distortion channel and additive noise from online degraded speech, and the posterior estimates of short-time speech power spectra are obtained at the convergence of the EM algorithm. Any speech features derivable from power spectra can then be approximately estimated by minimum mean-squared error estimation. Experiments were performed on speaker-independent continuous speech recognition using as features the perceptually based linear prediction cepstral coefficients, energy, and temporal regression coefficients. Speech data were taken from the TIMIT database and were degraded by a distortion channel and colored noise at various SNR levels. Experimental results indicate that the proposed technique leads to convergent identification of channel and noise and significantly improved recognition accuracy.
Using high-level tools to implement software engineering projects
Authors: P. Brazier
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Describes a one-semester software engineering course that takes advantage of the high-level programming tools that are becoming increasingly available. It has always been difficult to include necessary theoretical material as well as a complete software project in a one-semester course. In most traditional computer science degree programs, many students do not have room to take more than one semester of software engineering. A solution to this problem is to concentrate on the analysis and design phases of a project and to use high-level programming tools to develop a rapid prototype or to implement only part of the design. This paper describes student projects that used tools such as Visual Basic and ColdFusion in developing their projects. Projects involving Internet applications were particularly adaptable to this approach. Students were also encouraged to interface high-level languages such as Java and C++ with application software such as Microsoft Access and Excel, supporting the concepts of reuse and object-oriented design while providing a valuable experience in integration. This approach further introduces students to important software development planning and management issues, such as the proper choice of platform for the project, risk assessment, and assessment and utilization of team members' expertise and talents. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A packet discard scheme for loss control in IP networks with MPEG video traffic
Authors: M. R. Ito, Y. Bai
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

An important issue for video transmission over IP networks is preservation of perceived video quality despite packet loss. Packet loss can be detrimental to compressed video. However, reducing packet loss to a very low level is difficult with current loss control techniques. Furthermore, even a very low objective loss probability can still seriously distort perceived video quality. This paper proposes a loss control scheme using video characteristics. It increases maximum loss tolerance for a desired level of video quality, providing better quality at equal loss ratios, as compared to a conventional packet discard scheme. Meanwhile, network efficiency is also improved.
Investigating diversity of clustering methods: An empirical comparison
Authors: Roy Gelbard, Orit Goldman, Israel Spiegler
Venue: Data Knowledge Engineering (2007)

The paper aims to shed some light on the question why clustering algorithms, despite being quantitative and hence supposedly objective in nature, yield different and varied results. To do that, we took 10 common clustering algorithms and tested them over four known datasets, used in the literature as baselines with agreed upon clusters. One additional method, Binary-Positive, developed by our team, was added to the analysis. The results affirm the unpredictable nature of the clustering process, point to different assumptions taken by different methods. One conclusion of the study is to carefully choose the appropriate clustering method for any given application.
Building a disordered protein database: a case study in managing biological data
Authors: Arran D. Stewart, Xiuzhen Zhang
Venue: Proceedings of the eighteenth conference on Australasian database - Volume 63 (2007)

A huge diversity of biological databases is available via the Internet, but many of these databases have been developed in an ad hoc manner rather than in accordance with any data management principles. In addition, in the area of disordered protein databases, many of the databases have not been made publicly available. This poses challenges to researchers, since reliable protein databases are required in order to test and measure the accuracy of protein structure prediction software. In this paper, we describe our work developing a disordered protein database using data from the protein secondary structure database DSSP-cont. In particular, we discuss the way in which we have addressed the issues of data cleaning, query processing and interoperability. This research is a pilot study in managing biological data.
Using hypermedia for complex technologies education
Authors: M. D. Valdes
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

Complex technologies are very difficult to explain because they include a lot of related concepts comprising a large number of nonexcluding or excluding subconcepts. Usually, complex technologies education is based on the analysis of specific devices of several manufacturers, but this method is not suitable because it gives only a particular insight. This situation demands a new methodology that summarizes all the characteristics of a particular technology and makes a dynamic link between the related concepts possible. From this perspective this paper describes an original method for the characterization of complex technologies and proposes the hypermedia technique as a suitable solution for its practical implementation. The method has been applied for teaching programmable logic devices (PLDs), a very complex technology that constitutes one of the most dynamic areas of microelectronics.
An Extended AND Operations for Retrieving a Flexible Information Unit from Tree Structured Data
Authors: Taira Yoda, Hidenari Kiyomitsu, Kazuhiro Ohtsuki, Jun-ya Morishita
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

Recently, enormous volume of data is created and it has been increasing. Various types of data is collected in data storages. Each of data management system utilises indevidual retrieval mechanism arbitrarily, users get into difficulty that they need to obey a query manor for each systems. In our work, we focus on the ubiquity of the retrieval and we discuss about a representation of user's query intention and a method for reflecting it in the retrieval. Conceptually, fork and chain on a tree structure could be regarded as coordinate and subrodinate respectively. Therefore, we atempt to use for data retrieval with lapping relationships between user input keywords on the tree structure. Our assuming user is a person or a device which can make a tree to issue a query. We introduce an elaborate use of the tree.
Medical Image Registration by Simulated Annealing and genetic algorithms
Authors: Samy Ait-Aoudia, Ramdane Mahiou
Venue: Proceedings of the Geometric Modelling and Imaging (2007)

Registration techniques in medical image processing are used to match anatomic structures from two or more images (CT, MRI, PET,) taken at different times to track for example the evolution of a disease. The core of the registration process is the maximization of a cost function expressing the similarity between these images. To resolve this problem, we have tested two global optimization techniques that are genetic algorithms and simulated annealing. In this paper we show some results obtained in medical images registration.
Diversity signal reception via soft decision combining
Authors: Qian Zhang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

The problem of diversity signal reception using quantized data is considered. This problem arises in situations where multiple receivers are employed over a geographically broad area. We propose a method for the design of the quantizers that are used by the receiver to make soft decisions. This quantizer minimizes the mean-squared error between the quantizer output and the log-likelihood ratio associated with the receiver observation. The soft decisions are then combined at a central location to yield the final decision. Our quantizers are then applied to the coherent detection of a BPSK signal over Rayleigh fading channels. Simulation results show that using coarse quantizers yields close to optimum performance.