ppxscal/embedding_network huggingface dataset:
Using evolvable genetic cellular automata to model breast cancer
Authors: Armand Bankhead,  Iii, Robert B. Heckendorn
Venue: Genetic Programming and Evolvable Machines (2007)

Cancer is an evolutionary process. Mutated cells undergo selection for abnormal growth and survival creating a tumor. We model this process with cellular automata that use a simplified genetic regulatory network simulation to control cell behavior and predict cancer etiology. Our genetic model gives us the ability to relate genetic mutation to cancerous outcomes. The simulation uses known histological morphology, cell types, and stochastic behavior to specifically model ductal carcinoma in situ (DCIS), a common form of non-invasive breast cancer. Using this model we examine the effects of hereditary predisposition on DCIS incidence and aggressiveness. Results show that we are able to reproduce in vivo pathological features to hereditary forms of breast cancer: earlier incidence and increased aggressiveness. We also show that a contributing factor to the different pathology of hereditary breast cancer results from the ability of progenitor cells to pass cancerous mutations on to offspring.
Drm to counter side-channel attacks?
Authors: Ryad Benadjila, Olivier Billet, Stanislas Francfort
Venue: Proceedings of the 2007 ACM workshop on Digital Rights Management (2007)

In the DRM setting, the attacker is a very powerful adversary, owning the software as well as the underlying hardware. This context is far different from the black-box attacker commonly considered in conventional cryptography.Therefore, cryptographers have tried to design new cryptographic tools fitting the DRM requirements. A related issuein cryptography is that of side-channel attacks, where theattacker is stronger than the black-box attacker, but usually weaker than a DRM attacker. In this paper, we aim toshow that the study of side-channel attacks can benefit fromDRM research, and in particular from the attacker modelsand solutions tailored to this specific setting. We focus ona specific issue, namely the cache attacks against the AES,and show how current counter-measures can be seen as restricted versions of a previous protection proposed in theDRM setting. We demonstrate that those kind of counter-measures are weak against cache-based side-channel attacks by reusing results from the DRM setting.
Special Tutorial: The Organization of Electronic Cyclic Memories
Authors: H. S. Stone
Venue: Computer (1976)

Cyclic memories are memories in which data rotate cyclically past a read/write port. The most common cyclic memories in use today are mechanical drums and fixed-head disks. In the past, small electronic cyclic memories have been made from MOS technology; more recently they have been made from charge-coupled devices and magnetic bubbles. Because of advances in integrated technology, large electronic cyclic memories that might be replacements for drum and disk memories are likely to become available. Whereas it is difficult to predict what technology will eventually emerge for electronic auxiliary memories, present projections suggest that cyclically organized memories based upon magnetic bubbles or charge-coupled devices are potential candidates. The disadvantage of cyclic organization is that access time due to memory latency may be excessive. The problem we investigate in this paper is how to modify electronic cyclic memories in relatively minor and inexpensive ways so as to decrease rotational latency in a system environment.
Research on Counter Bandwidth Depletion DDoS Attacks Based on Genetic Algorithm
Authors: Rui Guo, Guiran Chang, Ruidong Hou, Yuhai Qin, Baojing Sun, An Liu, Yan Jia, Dan Peng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

In this paper, we advocate that routers will filter bandwidth depletion of DDoS traffic. It is our consideration that server owners who experience an attack should work with ISP routers to defend DDoS. The main idea is to use statistical approaches of Netflow to allocate weighted bandwidth at the routers. We propose a new algorithm based on Genetic Algorithm to filter traffic on routers and maximize goodput. The feasibility and effectiveness of our approach is validated by measuring the performance of an experimental prototype against a series of attacks. The advantages of the scheme are discussed and further research directions are given.
Online Protocol Testing for FPGA Based Fault Tolerant Systems
Authors: Jiri Tobola, Zdenek Kotasek, Jan Korenek, Tomas Martinek, Martin Straka
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

In this paper, the methodology for automated design of checker for communication protocol testing is presented. Based on the level of checking, different design strategies can be performed - in the paper the lowest level is presented. The definition of dedicated language for the description of possible communication faults is presented. The core generator is used to produce VHDL code describing the behaviour of the checker.
Interactive schedulability analysis
Authors: Unmesh D. Bordoloi, Samarjit Chakraborty
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2007)

A typical design process for real-time embedded systems involves choosing the values of certain system parameters and performing a schedulability analysis to determine whether all deadline constraints can be satisfied. If such an analysis returns a negative answer, then some of the parameters are modified and the analysis is invoked once again. This iteration is repeated until a schedulable design is obtained. However, the schedulability analysis problem for most task models is intractable (usually co-NP hard) and, hence, such an iterative design process is often very expensive. To get around this problem, we introduce the concept of &ldquo;interactive&rdquo; schedulability analysis. It is based on the observation that if only a small number of system parameters are changed, then it is not necessary to rerun the full schedulability analysis algorithm, thereby making the iterative design process considerably faster. We refer to this analysis as being &ldquo;interactive&rdquo; because it is supposed to be run in an interactive mode. This concept is fairly general and can be applied to a wide variety of task models. In this paper, we have chosen the recurring real-time task model, because it can be used to represent realistic applications from the embedded systems domain (containing conditional branches and fine-grained deadline constraints). Our experimental results show that using our scheme can lead to more than 20&times; speedup for each invocation of the schedulability analysis algorithm, compared to the case where the full algorithm is run.
An Experiment in Software Error Data Collection and Analysis
Authors: N. F. Schneidewind
Venue: IEEE Transactions on Software Engineering (1979)

The propensity to make programming errors and the rates of error detection and correction are dependent on program complexity. Knowledge of these relationships can be used to avoid errorprone structures in software design and to devise a testing strategy which is based on anticipated difficulty of error detection and correction. An experiment in software error data collection and analysis was conducted in order to study these relationships under conditions where the error data could be carefully defined and collected. Several complexity measures which can be defined in terms of the directed graph representation of a program, such as cyclomatic number, were analyzed with respect to the following error characteristics: errors found, time between error detections, and error correction time. Signifiant relationships were found between complexity measures and error charateristics. The meaning of directed grph structural properties in terms of the complexity of the programming and testing tasks was examined.
Tracking, analyzing, and visualizing learners' activities on discussion forums
Authors: Madeth May, Sébastien George, Patrick Prévôt
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

Computer Mediated Communication (CMC) tools, such as forums, chats, etc., have become compulsory for distance learning situations, in facilitating the communications between learners, and between learners and instructors. Meanwhile, tracking the communications on CMC tools has also become one among other research interests and brought up a number of challenges and difficulties: exploitation of collected traces, providing synthetic information of communication activities via trace analysis, reusability of traces, etc. Our research works are biased toward methodological challenges involved in designing and developing a generic system for tracking user's activities while interacting with asynchronous communication tools like discussion forums. The main aim of the suggested approach that we present in this paper is for building a Web-based system architecture, which is composed of different trace collectors (client side and server side), trace manipulation procedures, trace repository, trace analysis, and trace visualization.
A learning evaluation framework to support the schoolsenses@internet project
Authors: Cristina A. Gomes, Maria J. Marcelino, Maria J. Silva, Fernando Lima
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

This paper presents a collaborative learning systems' evaluation approach to support the Schoolsenses@Internet project. This project involves the collaborative creation of geo-referenced multisensory information by primary school children. The paper begins by presenting and discussing some evaluation practices in the area of collaborative learning systems. Evaluation activities and results developed in the scope of the design and implementation of the mentioned project are explained. The paper also discusses broader issues related to quantitative and qualitative evaluation methods.
Investigating Test Teams' Defect Detection in Function test
Authors: Carina Andersson, Per Runeson
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

In a case study, the defect detection for functional test teams is investigated. In the study it is shown that the test teams not only discover defects in the features under test that they are responsible for, but also defects in interacting components, belonging to other test teams' features. The paper presents the metrics collected and the results as such from the study, which gives insights into a complex development environment and highlights the need for coordination between test teams in function test.
Scheduling the Asynchronous Fixed-Priority tasks with Preemption Threshold
Authors: XiaoChuan He, Yan Jia
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Fixed-priority with preemption threshold (FPPT) is an important form of real-time scheduling algorithm. However, most of current research works concerning FPPT assume the task priorities are predefined and have a task model which constraints all tasks are released simultaneously. This presumption is too pessimistic. The major contribution of this paper is an appropriate schedulability analysis, based on response time analysis, for supporting FPPT scheduling on asynchronous task set in hard real-time systems. The simulation result illustrate that our approach can improve the breakdown utilization of asynchronous task set by 5%-27%.
Self-Defense-Technologies for Automated Teller Machines
Authors: Hiroshi Sako, Takashi Watanbe, Hiroto Nagayoshi, Tatsuhiko Kagehiro
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

Automated teller machines obviously require functions for protecting themselves from crimes, because they must handle cash. This paper discusses self-defense-technologies based on image processing and recognition to realize such functions in the machines. The technologies include (i) banknote validation for preventing machines from receiving counterfeit banknotes, (ii) form & character recognition for preventing machines from accepting remittance forms with out of due dates, (iii) person identification to stop machines from transacting with non-customers, and (iv) object recognition to guard machines against foreign objects such as spy cams that may be attached to them. After describing the outline of the system, technologies (i), (ii), and (iii) are introduced. This paper concentrates on the object recognition technology for detecting foreign objects. Although the technology is based on conventional background-subtraction, we developed special noise reduction techniques to make it suitable for actual machines. The object recognition technology was evaluated in experiments using real 160-hour image video composed of about 8.6 x 106 frames in total, and the false-alarm rate and false-negative rate were 0.7% and 0%, respectively.
VCDECIS -- Knowledge Online Advanced Content Management Using a Semantic Network
Authors: Ernst Forstner, Reinhard Stumptner, Bernhard Freudenthaler, Josef Kung
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

The ambitious goal of VCDECIS (Vienna Consulting Decision Support System) is the establishment of a well organized system which supports the experts and engineers in all tasks during the assessment of structures based on Ambient Vibration Monitoring. Real expertise, as required in structural dynamics, is characterized by a combination of complexity and a short period of validity. The current practice in Structural Health Monitoring is a case to case approach which needs a lot of experience for proper interpretation and assessment. VCDECIS enables access to the existing knowledge represented in data or literature resulting from former efforts.
Letters: Kernel subclass discriminant analysis
Authors: Bo Chen, Li Yuan, Hongwei Liu, Zheng Bao
Venue: Neurocomputing (2007)

In order to overcome the restricts of linear discriminant analysis (LDA), such as multivariate Normal distributed classes with equal covariance matrix but different means and the single-cluster structure in each class, subclass discriminant analysis (SDA) is proposed recently. In this paper the kernel SDA is presented, called KSDA. Moreover, we reformulate SDA so as to avoid the complicated derivation in the feature space. The encouraging experimental results on eight UCI data sets demonstrate the efficiency of our method.
Transparency and technology appropriation: social impacts of a video blogging system in dental hygiene clinical instruction
Authors: L. Amaya Becvar, James D. Hollan
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

This work describes a multi-year ethnography-for-design study in a dental hygiene training program in San Diego, USA. We performed an ethnographic analysis of instructional practices used in clinical instruction, and helped design a new training laboratory, equipped with digital media technology, through which students and instructors could access a video blogging ('vlogging') system. We present an analysis of how the vlogging system transformed social and instructional interactions in clinical training. Additionally, we describe how the faculty's appropriation of vlog technology was initially challenged by the presentation of divergent methodology in vlog records, and increased transparency of teaching practices in video records.
Regional Assessment of Soil Erosion Based on the Multivariate Membership Model
Authors: Dianhui Mao, Zhiyuan Zeng, Cheng Wang, Weihua Lin
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Regional-scale soil erosion assessment is important, but limited by the development of soil erosion model. This paper presents a new region-scaled soil erosion qualitative model: the multivariate membership model and the E'Dong Mountain is selected as case study area. The model chooses the four factor indexes affected erosion intensity: precipitation of rainy periods slope gradientspercentage of vegetation cover and land use type, then construct the multivariate membership function and rank the fuzzy sets of erosion intensity class based on fuzzy mathematics processing the observed sample data. The result has shown that the model can obtain the good correlation between the erosion intensity and erosion controlling factors in theory. In addition, multi-resource data are integrated into ArcInfo system(a GIS platform) to generate the map of soil erosion intensity of study area based on the model. Thus, the model provides a new method for assessing the soil erosion in regional scale.
The Chord Keyboard
Authors: N. Rochester
Venue: Computer (1978)

A keyboard prototype offers one-handed operation, small size, low cost of manufacture, and permits the touch typing of large alphabets.
A General Empirical Solution to the Macro Software Sizing and Estimating Problem
Authors: L. H. Putnam
Venue: IEEE Transactions on Software Engineering (1978)

Application software development has been an area of organizational effort that has not been amenable to the normal managerial and cost controls. Instances of actual costs of several times the initial budgeted cost, and a time to initial operational capability sometimes twice as long as planned are more often the case than not.
A Digital Signature Schemes Without Using One-way Hash and Message Redundancy and Its Application on Key Agreement
Authors: Hua Zhang, Zheng Yuan, Qiao-yan Wen
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Digital signature schemes based on public-key cryptosystems are important building blocks of key agreement protocols. They are vulnerable by existential forgery attack. A usual method to prevent existential forgery attack is on-way hash function and message redundancy. In 2004, Chang and Chang proposed a new digital signature scheme. The scheme is without using one-way hash function and any redundancy padding, which is very interesting to many designers. Recently, Chien found an existential forgery attack. In this paper, we show another forgery attack on it and propose an improved scheme without oracle, which is secure against existential forgery attacks. Then we proposed a key agreement protocol by amending the signature slightly.
New Products
Venue: Computer (1970)

With this issue, the New Product emphasis is structured toward providing an understanding of technological developments, as well as providing the traditional source of product information pertinent to the system developer. 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
Asymptotic Approximations for the Number of Fanout-Free Functions
Authors: E. A. Bender
Venue: IEEE Transactions on Computers (1978)

Expressions are derived for the approximate number of functions realized by various n-variable fanout-free networks. Six recently studied networks are considered. It is shown that the relative number of functions realized by two networks for small and large n is quite different in certain cases.
Simplified Partial Digest Problem: Enumerative and Dynamic Programming Algorithms
Authors: Jacek Blazewicz, Edmund Burke, Marta Kasprzak, Alexandr Kovalev, Mikhail Kovalyov
Venue: IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB) (2007)

We study the Simplified Partial Digest Problem (SPDP), which is a mathematical model for a new simplified partial digest method of genome mapping. This method is easy for laboratory implementation and robust with respect to the experimental errors. SPDP is NP-hard in the strong sense. We present an $O(n2^n)$ time enumerative algorithm and an $O(n^{2q})$ time dynamic programming algorithm for the error-free SPDP, where $n$ is the number of restriction sites and $q$ is the number of distinct intersite distances. We also give examples of the problem, in which there are $2^{\frac{n+2}{3}-1}$ non-congruent solutions. These examples partially answer a question recently posed in the literature about the number of solutions of SPDP. We adapt our enumerative algorithm for handling SPDP with imprecise input data. Finally, we describe and discuss the results of the computer experiments with our algorithms.
Space-Time Behavior-Based Correlation—OR—How to Tell If Two Underlying Motion Fields Are Similar Without Computing Them?
Authors: Eli Shechtman, Michal Irani
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

We introduce a behavior-based similarity measure which tells us whether two different space-time intensity patterns of two different video segments could have resulted from a similar underlying motion field. This is done directly from the intensity information, without explicitly computing the underlying motions. Such a measure allows us to detect similarity between video segments of differently dressed people performing the same type of activity. It requires no foreground/background segmentation, no prior learning of activities, and no motion estimation or tracking. Using this behavior-based similarity measure, we extend the notion of 2-dimensional image correlation into the 3-dimensional space-time volume, thus allowing to correlate dynamic behaviors and actions. Small space-time video segments (small video clips) are "correlated" against entire video sequences in all three dimensions (x,y, and t). Peak correlation values correspond to video locations with similar dynamic behaviors. Our approach can detect very complex behaviors in video sequences (e.g., ballet movements, pool dives, running water), even when multiple complex activities occur simultaneously within the field-of-view of the camera. We further show its robustness to small changes in scale and orientation of the correlated behavior.
2007 Annual Index, Vol. 27, IEEE Computer Graphics and Applications
Venue: IEEE Computer Graphics and Applications (2007)

A comprehensive listing of the articles and departments included in Volume 27 of IEEE Computer Graphics and Applications.
1st International Global Requirements Engineering Workshop (GREW '07)
Authors: Tony Gorschek, Samuel Fricker
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

GREW´07 brings researchers and industry practitioners together to discuss the area of global product development from a requirements engineering and product management perspective. The workshop aims at analyzing selected challenges, which are put forward by accepted papers, in detail., The session discussions then lift the view in an attempt to identify the future needs with regards to research and study.
Autotesting Speed-Independent Sequential Circuits
Authors: G. Cioffi
Venue: IEEE Transactions on Computers (1978)

Speed-independent sequential circuits are characterized by an input-output behavior which is independent of the actual delays of the circuitry; this means that any unbounded delay is allowed in the component gates. This performance is accomplished by means of a control circuit which recognizes when the circuit is ready to accept a next input datum, and therefore a speed independent synthesis is realizable if and only if the input source can be controlled by the circuit itself.