ppxscal/embedding_network huggingface dataset:
Intelligent Detection Approaches for Spam
Authors: Guangchen Ruan, Ying Tan
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

This paper proposes intelligent detection approaches based on Incremental Support Vector Machine and Artificial Immune System for the spam of e-mail stream. In the approaches, a window is used to hold several classifiers each of which classifies the e-mail independently and the label of the e-mail is given by a strategy of majority voting. Exceeding margin update technique is also used for the dynamical update of each classifier in the window. A sliding window is employed for purge of out-of-date knowledge so far. Techniques above endow our algorithm with dynamical and adaptive properties as well as the ability to trace the changing of the content of e-mails and user's interests in a continuous way. We conduct many experiments on two public benchmark corpus called PU1 and Ling. Experimental results demonstrate that the proposed intelligent detection approaches for spam give a promising performance.
The Interactive Wiring System
Authors: F. D. Skinner
Venue: IEEE Computer Graphics and Applications (1981)

By using directed-beam displays, light pens, and a flexible data base, this interactive in-house tool speeds design time. 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
CIVIC: a Hypervisor based Virtual Computing Environment
Authors: Jinpeng Huai, Qin Li, Chunming Hu
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

The purpose of virtual computing environment is to improve resource utilization by providing a unified integrated operating platform for users and applications based on aggregation of heterogeneous and autonomous resources. With the rapid development in recent years, hypervisor technologies have become mature and comprehensive with four features, including transparency, isolation, encapsulation and manageability. In this paper, a hypervisor based computing infrastructure, named CIVIC, is proposed. Compared with existing approaches, CIVIC may benefit in several ways. It offers separated and isolated computing environment for end users, and realizes hardware and software consolidation and centralized management. Beside this, CIVIC provides a transparent view to upper layer applications, by hiding the dynamicity, distribution and heterogeneousness of underlying resources. Performance of the infrastructure is evaluated by an initial deployment and experiment. The result shows that CIVIC can facilitate installation, configuration and deployment of network-oriented applications.
Agent based ServiceBSP Model with Superstep Service for Grid Computing
Authors: Weikai Miao, Weiqin Tong
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

This paper proposes an Agent Based ServiceBSP model with Superstep Service to support the parallel computing in grid environment. Superstep Service is an agent infrastructure handling different types of agents. In this model, the Service Selection Agent generated by Superstep Service selects computation services with QoS (Quality of Service) consideration using the IP (Integer Program) approach. A computing-intensive application is divided into a group of parallel tasks. Each of them is wrapped into a Task Agent migrating to the local domain of the selected computational services. These Task Agents are organized in BSP (Bulk Synchronous Parallelism) style, which helps the users to develop performance predictable applications. The experiment shows that the Service Selection Agent can provide the users with satisfied QoS of the applications. And the agents can be generated at low cost.
Distributed Simulation: A Case Study in Design and Verification of Distributed Programs
Authors: K. M. Chandy
Venue: IEEE Transactions on Software Engineering (1979)

The problem of system simulation is typically solved in a sequential manner due to the wide and intensive sharing of variables by all parts of the system. We propose a distributed solution where processes communicate only through messages with their neighbors; there are no shared variables and there is no central process for message routing or process scheduling. Deadlock is avoided in this system despite the absence of global control. Each process in the solution requires only a limited amount of memory. The correctness of a distributed system is proven by proving the correctness of each of its component processes and then using inductive arguments. The proposed solution has been empirically found to be efficient in preliminary studies. The paper presents formal, detailed proofs of correctness.
Effects of CH2F2 and H2 flow rates on process window for infinite etch selectivity of silicon nitride to ArF PR in dual-frequency CH2F2/H2/Ar capacitively coupled plasmas
Authors: C. K. Park, H. T. Kim, C. H. Lee, N. E. Lee, Hyungsoo Mok
Venue: Microelectronic Engineering (2008)

The process window for the infinite etch selectivity of silicon nitride (Si"3N"4) layers to ArF photoresist (PR) and ArF PR deformation were investigated in a CH"2F"2/H"2/Ar dual-frequency superimposed capacitive coupled plasma (DFS-CCP) by varying the process parameters, such as the low frequency power (P"L"F), CH"2F"2 flow rate, and H"2 flow rate. It was found that infinitely high etch selectivities of the Si"3N"4 layers to the the ArF PR on both the blanket and patterned wafers could be obtained for certain gas flow conditions. The H"2 and CH"2F"2 flow rates were found to play a critical role in determining the process window for infinite Si"3N"4/ArF PR etch selectivity, due to the change in the degree of polymerization. The preferential chemical reaction of hydrogen with the carbon in the hydrofluorocarbon (CH"xF"y) layer and the nitrogen on the Si"3N"4 surface, leading to the formation of HCN etch by-products, results in a thinner steady-state hydrofluorocarbon layer and, in turn, in continuous Si"3N"4 etching, due to enhanced SiF"4 formation, while the hydrofluorocarbon layer is deposited on the ArF photoresist surface.
Metastable Behavior in Digital Systems
Authors: Lindsay Kleeman, Antonio Cantoni
Venue: IEEE Design Test (1987)

Fault-free digital circuits may malfunction when asynchronous inputs have critical timing combinations that result in metastableoperation. This mode of failure is often overlooked in digital system design and reliability analysis. Here, we survey developmentsin the study of metastable behavior and identify their relevance to digital system design and reliability, and we describeand evaluate a number of techniques for reducing the probability of metastable failure.
Power Supply Noise in SoCs: Metrics, Management, and Measurement
Authors: Karim Arabi, Resve Saleh, Xiongfei Meng
Venue: IEEE Design Test (2007)

Power integrity is emerging as a major challenge in SoC designs in deep-submicron (DSM) technologies. Existing design and analysis techniques and metrics fail to provide an accurate impact estimation of power supply noise, making it difficult to optimize design and test procedures. The lack of predictability is complicating timing closure, physical design, production test, and speed-grading of SoCs. Furthermore, traditional power supply noise reduction techniques are not capable of addressing some of the new issues that have arisen in DSM. This article describes and validates two metrics that quantify the impact of power supply noise. The authors propose modified decoupling-capacitor (decap) designs and present results of silicon experimentation. They also discuss the true impact of power supply noise on production test, and present DFT techniques to reduce power supply noise during testing.
Wavelet-Based Multi-scale GVF Snake Model for Image Segmentation
Authors: Zhang Jun, Wang Guozheng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Gradient Vector Flow snake creates its own external GVF force field, this makes itself has the ability to move into boundary concavities and can be initialized far away from the boundary. However, the cost of the above advancement is the larger amount of computation and the higher sensitivity to noise. After wavelet transform, the local module maxima of the image's wavelet coefficients vary in different way in multi resolution due to the different singularities of signal and noise, so noise can also be distinguished from signal with multi-scale GVF snake model. In the lower resolution, there are less wavelet coefficients and the GVF snake is easy to deform to the contour without much computation and is less interfered by noise. In higher resolution, on the basis of the initial position of the foregoing resolution, much more computation will be saved. The 3-order spline function has similar structure with Gauss function as the smoothing function, its derivative is a compact support function that could be used as B-spline wavelet. From some experiments, it can be seen that the multi-scale GVF snake model is more quickly and robust contrast to GVF snake model.
PSIST: A scalable approach to indexing protein structures using suffix trees
Authors: Feng Gao, Mohammed J. Zaki
Venue: Journal of Parallel and Distributed Computing (2008)

Approaches for indexing proteins and for fast and scalable searching for structures similar to a query structure have important applications such as protein structure and function prediction, protein classification and drug discovery. In this paper, we develop a new method for extracting local structural (or geometric) features from protein structures. These feature vectors are in turn converted into a set of symbols, which are then indexed using a suffix tree. For a given query, the suffix tree index can be used effectively to retrieve the maximal matches, which are then chained to obtain the local alignments. Finally, similar proteins are retrieved by their alignment score against the query. Our results show classification accuracy up to 50% and 92.9% at the topology and class level according to the CATH classification. These results outperform the best previous methods. We also show that PSIST is highly scalable due to the external suffix tree indexing approach it uses; it is able to index about 70,500 domains from SCOP in under an hour.
A Reliability Model for Gracefully Degrading and Standby-Sparing Systems
Authors: B. R. Borgerson
Venue: IEEE Transactions on Computers (1975)

A model for analyzing the reliability of gracefully degrading and standby-sparing computer systems is developed. The basis of the model is the identification of four distinct causes of crashes: time-domain multiple faults, resource exhaustion, space-domain multiple faults, and solitary faults. Expressions are developed for each of these crash-causing mechanisms and for their interrelationship. The model is then demonstrated by using it to analyze the reliability of a gracefully degrading computer system called PRIME.
Cooperative Cleaners: A Study in Ant Robotics
Authors: Israel A. Wagner, Yaniv Altshuler, Vladimir Yanovski, Alfred M. Bruckstein
Venue: International Journal of Robotics Research (2008)

In the world of living creatures, simple-minded animals often cooperate to achieve common goals with amazing performance. One can consider this idea in the context of robotics, and suggest models for programming goal-oriented behavior into the members of a group of simple robots lacking global supervision. This can be done by controlling the local interactions between the robot agents, to have them jointly carry out a given mission. As a test case we analyze the problem of many simple robots cooperating to clean the dirty floor of a non-convex region in Z2, using the dirt on the floor as the main means of inter-robot communication.
Minimization of Linear Sequential Machines
Authors: Chi-Tsong Chen
Venue: IEEE Transactions on Computers (1974)

An algorithm is presented to minimize linear sequential machines to reduced form.
Advanced Learning of SOR Network Employing Evaluation-based Topology Representing Network
Authors: Takeshi Yamakawa, Keiichi Horio, Takahiro Tanaka
Venue: Proceedings of the 7th International Conference on Hybrid Intelligent Systems (2007)

Learning systems such as multi-layer feed-forward neural networks, wavelet networks and so on need appropriate learning data (input data and teaching output data). These methods are not so useful in case when we cannot get the appropriate learning data.Even in this case, it is not so difficult to evaluate the system output for arbitrarily applied input. The learning data of input-output pairs with their evaluations are easily obtained and thus is easily used for modeling the system. SOR (Self-organizing Relationship) network is a modeling tool, which can be established by a set of input-output data and corresponding evaluation. This SOR network can act as a knowledge acquisition system and also act as a fuzzy inference engine. The linkage among the units in competitive layer is fixed and not flexible, and thus not used for complicated systems. In this plenary talk, the advanced learning process is presented for the original SOR network by employing evaluation-based TRN (topology representing network). By this learning, the linkage among the units in the competitive layer can be more flexible and thus used for modeling of much more complicated systems. The application of the SOR network established by this learning process to a manipulation control is also presented.
A Replicate Empirical Comparison between Pair Development and Software Development with Inspection
Authors: Monvorath Phongpaibul, Barry Boehm
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

In 2005, we studied the development effort and effect of quality comparisons between software development with Fagan's inspection and pair development. Three experiments were conducted in Thailand: two classroom experiments and one industry experiment. We found that in the classroom experiments, the pair development group had less average development effort than the inspection group with the same or higher level of quality. The industry experiment's result showed pair development to have a bit more effort but about 40% fewer major defects. However, since this set of experiments was conducted in Thailand, the results may be different if we conducted the experiment in other countries due to the impact of cultural differences. To investigate this we conducted another experiment with Computer Science graduate students at USC in Fall 2006. Unfortunately, the majority of the graduate students who participated in the experiment were from India, a country in which the culture is not much different from Thailand [18], 19]. As a result, we cannot compare the impact of cultural differences in this paper. However, the results showed that the experiment can be replicated in other countries where the cultures are similar.
Basic Concepts in Covering-Based Rough Sets
Authors: William Zhu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

Uncertainty and incompleteness of knowledge are widespread phenomena in information systems. Rough set theory is a tool for dealing with granularity and vagueness in data analysis. Rough set method has already been applied to various fields such as process control, economics, medical diagnosis, biochemistry, environmental science, biology, chemistry psychology, and conflict analysis. Covering-based rough set theory is an extension to classical rough sets. In this paper we study relationship between several basic concepts involved in covering-based rough sets. In this way we will have a better understanding of covering-based rough sets.
Packet-by-Packet Adaptive Scheme for Video Coding and Transmission Over Wireless IP Networks Using Rate-Compatible Punctured Turbo (RCPT) Codes
Authors: Yong Pei, Viraj S. Ambetkar
Venue: Wireless Personal Communications: An International Journal (2007)

In this paper, we consider real-time video coding and transmission over packet-switched wireless IP networks, such as WLAN, using RCPT codes and joint source-channel coding (JSCC) with concentration on a packet-by-packet adaptive scheme. We present a systematic design methodology to enable the applicability of JSCC techniques. The performance of H.263+ video coding and transmission over wireless channel modeled as slow Rician fading channels using this approach is studied. Results indicate that a packet-by-packet adaptive RCPT-JSCC approach is of significant advantage for real-time video applications and leads to more acceptable video delivery quality over interference-limited and time-varying wireless networks.
Virtual Quality Assurance Facilitation Model
Authors: Rajesh Agarwal, Pinakpani Nayak, Manickam Malarvizhi, P Suresh, Nina Modi
Venue: Proceedings of the International Conference on Global Software Engineering (2007)

The IT industry's annual growth rate of ~40% has put immense pressure on the Software Quality Assurance function. Motivated by this challenge, we evaluated various options, before adopting virtual quality assurance facilitation at TCS. In the As-Is model, TCS has a traditional quality organization wherein a small number of full-time software quality analysts facilitate several projects each, with reporting independent of the delivery organization. In the To-Be model, we envisaged many part-time SQAs facilitating a smaller number of projects. Line reporting of the SQAs was to be left within the delivery organization. Evaluation of performance of this model has been very encouraging. Internalization of processes, building competency, and maintaining process stability with reduced cost were some key benefits. This paper describes the genesis, results, benefits, and challenges as experienced during the pilot and suggests the way ahead for deploying the virtual SQA function in large, mature IT organizations.
Sequential voting rules and multiple elections paradoxes
Authors: Lirong Xia, Jérôme Lang, Mingsheng Ying
Venue: Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge (2007)

Multiple election paradoxes arise when voting separately on each issue from a set of related issues results in an obviously undesirable outcome. Several authors have argued that a sufficient condition for avoiding multiple election paradoxes is the assumption that voters have separable preferences. We show that this extremely demanding restriction can be relaxed into the much more reasonable one: there exists a linear order x1 > &hellip; > xp on the set of issues such that for each voter, every issue xi is preferentially independent of xi+1, &hellip;, xp given x1, &hellip;, xi-1. This leads us to define a family of sequential voting rules, defined as the sequential composition of local voting rules. These rules relate to the setting of conditional preference networks (CP-nets) recently developed in the Artificial Intelligence literature. We study in detail how these sequential rules inherit, or do not inherit, the properties of their local components. We focus on the case of multiple referenda, corresponding to multiple elections with binary issues.
Edge-colouring of regular graphs of large degree
Authors: Caterina De Simone, Anna Galluccio
Venue: Theoretical Computer Science (2007)

We consider the following conjecture: LetGbe ak-regular simple graph with an even numbernof vertices. Ifk>=n/2thenGisk-edge-colourable. We show that this conjecture is true for graphs that are join of two graphs and we provide a polynomial time algorithm for finding a k-edge-colouring of these graphs.
Mixed-method validation of pedagogical concepts for an intercultural online learning environment: a case study
Authors: Effie Lai-Chong Law, Anh Vu Nguyen-Ngoc, Selahattin Kuru
Venue: Proceedings of the 2007 international ACM conference on Supporting group work (2007)

The rise of social software poses the challenges to the design and evaluation of a pedagogically sound online learning environment (OLE). Our OLE addresses these challenges by the integration of three pedagogical concepts - cross-cultural collaboration, self-directed learning and social networking - with the aim to advance participants' competencies and by mixed-method approaches to evaluating the complex situations. A validation trial involving four European countries was conducted. Groups of students co-created a questionnaire, which was assessed to provide an indicator of task performance. Multi-source (surveys, blogs, emails, diaries, chats, videoconference, and interviews) and multi-perspective data (facilitators, students, researchers) were studied with social network analysis, content analysis and conversation analysis. Several a posteriori research questions are addressed.
PyPBS design and methodologies
Authors: G. Hoover, F. Brewer
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

This paper presents results on processor specification from a specialized high-level finite state machine (FSM) language. The language is an extension and enhancement of earlier production based specification (regular automata) work using modern software techniques of modularization, abstraction, and object orientation. A brief overview of the language, its synthesis technique, description methods and advantages are presented for a variety of common synchronous pipeline structures in the context of the design of a synthesizable instruction-stream parallel microcontroller.
A derandomized approach to self-adaptation of evolution strategies
Authors: Andreas Ostermeier, Andreas Gawelczyk, Nikolaus Hansen
Venue: Evolutionary Computation (1994)

Comparable to other optimization techniques, the performance of evolution strategies (ESs) depends on a suitable choice of internal strategy control parameters. Apart from a fixed setting, ESs facilitate an adjustment of such parameters within a self-adaptation process. For step-size control in particular, various adaptation concepts have been evolved early in the development of ESs. These algorithms mostly work very efficiently as long as the scaling of the parameters to be optimized is known. If the scaling is not known, the strategy has to adapt individual step-sizes for all the parameters. In general, the number of necessary step-sizes (variances) equals the dimension of the problem. In this case, step-size adaptation proves to be difficult, and the algorithms known are not satisfactory. The algorithm presented in this paper is based on the well-known concept of mutative step-size control. Our investigations indicate that the adaptation by this concept declines due to an interaction of the random elements involved. We show that this weak point of mutative step-size control can be avoided by relatively small changes in the algorithm. The modifications may be summarized by the word “derandomization.” The derandomized scheme of mutative step-size control facilitates a reliable self-adaptation of individual step-sizes.