ppxscal/embedding_network huggingface dataset:
A Simple, Smart and Extensible Framework for Network Security Measurement
Authors: Feng Cheng, Christian Wolter, Christoph Meinel
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

Several efficient tools have emerged to aim at auditing and measuring the security of a computer system or an internal network. Along with the increasing complexity of network attacks, these tools become more and more complicated. Even so, most of them can only do simple snapshot analysis of the current system and are incapable of identifying possible attacks whose preconditions are not fulfilled at the beginning but may be possible during the further attack progression. This paper proposes a new framework for the security measurement that commits complex attack sequences and does stateful inspection of the target environment. The framework consists of five core components: Information Gatherer, Knowledge Base, Interaction Agent, Evaluation Engine and User Interface. An easy-to-use tool, called SNAPP, is realized based on the proposed framework. The dependencies among each attack step in an attack sequence revealed by SNAPP can be easily expressed using Attack Graphs which assist to make security evaluations of the testing environment. Several experiments that actually simulate and perform some well known penetration attacks using SNAPP are presented and analyzed for comparison and measurement of current security methods, such as the conventional filtering-based firewalls and our patented Lock-Keeper technology, which is an implementation of the high-level security concept "Physical Separation".
Cognitive Implications of Musical Perception
Authors: Adam Lockhart
Venue: Computer Music Modeling and Retrieval. Sense of Sounds: 4th International Symposium, CMMR 2007, Copenhagen, Denmark, August 27-31, 2007. Revised Papers (2008)

Any musical experience is innately pertinent to cognition and psychology. This paper discusses various aspects of musical cognition, including notions of timbre in relation to spectromorphology, a term coined by Denis Smalley, a notable writer on aesthetics of electroacoustic music. Furthermore, a cognitive model will serve to explain inherent inter-relationships involving multi-modal perception. 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
Towards an Algebraic Theory of Bidirectional Transformations
Authors: Perdita Stevens
Venue: Proceedings of the 4th international conference on Graph Transformations (2008)

Bidirectional transformations are important for model-driven development, and are also of wide interest in computer science. In this paper we present early work on an algebraic presentation of bidirectional transformations. In general, a bidirectional transformation must maintain consistency between two models, either of which may be edited, and each of which may incorporate information not represented in the other. Our main focus here is on lenses [2,1,3] which provide a particularly well-understood special case, in which one model is an abstraction of the other, and either the abstraction or the full model may be edited. We show that there is a correspondence between lenses and short exact sequences of monoids of edits. We go on to show that if we restrict attention to invertible edits, very well-behaved lenses correspond to split short exact sequences of groups; this helps to elucidate the structure of the edit groups.
Work domain analysis (WDA) for ecological interface design (EID) of vehicle control display
Authors: Suk Won Lee, Taek Su Nam, Rohae Myung
Venue: Proceedings of the 9th WSEAS International Conference on International Conference on Automation and Information (2008)

The purpose of this study is to apply WDA (Work Domain Analysis) to the development of vehicle control display and to confirm possibility of EID (Ecological Interface Design) on the vehicle control display. This research developed a work domain model by performing and using WDA of the work domain related to the vehicle operation. Further, information requirements were extracted to develop a vehicle control display on the basis of proposed model. By analyzing the drawn information requirements, it was confirmed that the information appeared on the vehicle control display currently in use is low-leveled (only the physical state of car) among the necessary information for the vehicle operation. Thus, the possibility of developing a new control display on the basis of newly extracted information requirements is confirmed. Based on the result of the research, an initiative ecological display which is to support the driver during the lane change task was designed.
Statistical Character Study of the Inert Coordinate Errors Caused by the Measurement Noise of the Netting Radar
Authors: Wen-Bo Zhao, Xiao-Chun Mei, Chuan Li, Yong-Ke Chen
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence (2008)

Considering the affection of measurement noise of the netting radar, the error components of the inert coordinates, including the netting radar inert coordinates and the netting fusion center inert coordinates, are given detail analysis in this paper. In the two kinds of the inert coordinates the corresponding statistical character of the errors caused by the measurement noise is educed in the form of the first order moment and the second order center moment. Lastly some conclusions are remarked.
Finite Automata, Digraph Connectivity, and Regular Expression Size
Authors: Hermann Gruber, Markus Holzer
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

Recently lower bounds on the minimum required size for the conversion of deterministic finite automata into regular expressions and on the required size of regular expressions resulting from applying some basic language operations on them, were given by Gelade and Neven [8]. We strengthen and extend these results, obtaining lower bounds that are in part optimal, and, notably, the presented examples are over a binary alphabet, which is best possible. To this end, we develop a different, more versatile lower bound technique that is based on the star height of regular languages. It is known that for a restricted class of regular languages, the star height can be determined from the digraph underlying the transition structure of the minimal finite automaton accepting that language. In this way, star height is tied to cycle rank, a structural complexity measure for digraphs proposed by Eggan and Büchi, which measures the degree of connectivity of directed graphs.
Analysis of Cu/Low-k structure under back end of line process
Authors: C. C. Chiu, C. C. Lee, T. L. Chou, C. C. Hsia, K. N. Chiang
Venue: Microelectronic Engineering (2008)

As the progress of the semiconductor process develops to achieve miniaturization and attain better performances for the electronic device, next-generation IC chips with deep sub-micron Cu/low-k stacked structures adopting the fabrication of (dual) damascene are developed to meet the urgent requirements of reducing high RC delay; the purpose of this is to obtain high-speed signal communication. However, due to poor adhesion and intrinsically lower fracture toughness of low-k materials as well as process loading that introduces flaws and delaminations, the phenomenon of crack growth is observed. To investigate the large scale difference problem, such as the back end of line (BEoL) structure to the silicon chip, a special multi-scale finite element simulation technology, global-local finite element method, is used to deal with this issue. The interfacial crack in the BEoL structure is modeled using the global-local technique. The chemical vapor deposition (CVD) process that induced loading to a micro crack in the interface between etch stop layer and metal track layer (ESL/Mx interface) will also be discussed through a statistical factorial design method in order to understand the crack growth phenomena that might occur during the BEoL process.
Exploiting Web Services and Model-Based User Interfaces for Multi-device Access to Home Applications
Authors: Giulio Mori, Fabio Paternò, Lucio Davide Spano
Venue: Interactive Systems. Design, Specification, and Verification: 15th International Workshop, DSV-IS 2008 Kingston, Canada, July 16-18, 2008 Revised Papers (2008)

This paper presents a method, and the corresponding software architecture and prototype implementation to generate multi-device user interfaces in the home domain. The approach is based on Web services and model-based user interface generation. In particular, it focuses on multi-device interfaces obtained starting with XML descriptions of home Web services, which are then mapped onto user interface logical descriptions, from which it is possible to then generate user interfaces adapted to the target devices. During use, the generated interfaces are able to communicate with the home Web services and can be dynamically updated to reflect changes in domestic appliances available and the associated state.
Topic 14 Mobile and Ubiquitous Computing
Authors: Nuno Preguiça, Éric Fleury, Holger Karl, Gerd Kortuem
Venue: Proceedings of the 13th European international conference on Parallel Processing (2007)

Mobile computing has evolved tremendously in the past few years with advances in wireless networks, mobile computing, sensor networks along with the rapid growth of small, portable and powerful computing devices. These advances offer opportunities for the development of new mobile/ubiquitous computing applications and services. Topic 14 of Europar 2007 covers all aspects related with the creation of such systems.
Improved Canny Edges Using Ant Colony Optimization
Authors: Ya-Ping Wong, Victor Chien-Ming Soh, Kar-Weng Ban, Yoon-Teck Bau
Venue: Proceedings of the 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation (2008)

Ant Colony Optimization (ACO) is a metaheuristic approach for solving hard optimization problem. It has been applied to solve various image processing problems such as image segmentation, classification, image analysis and edge detection. In this paper, we present an Improved Canny Edges (ICE-ACO) algorithm which uses ACO to solve the problem of linking disjointed edges produced by Canny Edge Detector.
Area and energy efficient vlsi architectures for low-density parity-check decoders using an on-the-fly computation
Authors: Gwan Choi, Scott Miller
Venue:  (2006)

The VLSI implementation complexity of a low density parity check (LDPC) decoder is largely influenced by the interconnect and the storage requirements. This dissertation presents the decoder architectures for regular and irregular LDPC codes that provide substantial gains over existing academic and commercial implementations. Several structured properties of LDPC codes and decoding algorithms are observed and are used to construct hardware implementation with reduced processing complexity. The proposed architectures utilize an on-the-fly computation paradigm which permits scheduling of the computations in a way that the memory requirements and re-computations are reduced. Using this paradigm, the run-time configurable and multi-rate VLSI architectures for the rate compatible array LDPC codes and irregular block LDPC codes are designed. Rate compatible array codes are considered for DSL applications. Irregular block LDPC codes are proposed for IEEE 802.16e, IEEE 802.11n, and IEEE 802.20. When compared with a recent implementation of an 802.11n LDPC decoder, the proposed decoder reduces the logic complexity by 6.45x and memory complexity by 2x for a given data throughput. When compared to the latest reported multi-rate decoders, this decoder design has an area efficiency of around 5.5x and energy efficiency of 2.6x for a given data throughput. The numbers are normalized for a 180nm CMOS process. Properly designed array codes have low error floors and meet the requirements of magnetic channel and other applications which need several Gbps of data throughput. A high throughput and fixed code architecture for array LDPC codes has been designed. No modification to the code is performed as this can result in high error floors. This parallel decoder architecture has no routing congestion and is scalable for longer block lengths. When compared to the latest fixed code parallel decoders in the literature, this design has an area efficiency of around 36x and an energy efficiency of 3x for a given data throughput. Again, the numbers are normalized for a 180nm CMOS process. In summary, the design and analysis details of the proposed architectures are described in this dissertation. The results from the extensive simulation and VHDL verification on FPGA and ASIC design platforms are also presented.
Topic 1: Support Tools and Environments
Authors: Marios Dikaiakos, Omer Rana, Shmuel Ur, Joao Lourenço
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

The spread of systems that provide parallelism either "in-the-large" (grid infrastr-uctures, clusters) or "in-the-small" (multi -core chips), creates new opportunities for exploiting parallelism in a wider spectrum of application domains. However, the increasing complexity of parallel and distributed platforms renders the programming, the use, and the management of these systems a costly endeavor that requires advanced expertise and skills. Therefore, there is an increasing need for powerful support tools and environments that will help end-users, application programmers, software engineers and system administrators to manage the increasing complexity of parallel and distributed platforms.
Hashconsing in an incrementally garbage-collected system: a story of weak pointers and hashconsing in ocaml 3.10.2
Authors: Pascal Cuoq, Damien Doligez
Venue: Proceedings of the 2008 ACM SIGPLAN workshop on ML (2008)

This article describes the implementations of weak pointers, weak hashtables and hashconsing in version 3.10.2 of the Objective Caml system, with focus on several performance pitfalls and their solutions.
Exploring teaching methods for on-line course delivery-using universal instructional design
Authors: Rebecca H. Rutherfoord, James K. Rutherfoord
Venue: Proceedings of the 9th ACM SIGITE conference on Information technology education (2008)

One of the challenging problems faced by faculty who teach on-line courses, is the ability to understand and accommodate various student learning styles. Many faculty are aware of different learning styles, and may apply different teaching methodologies in their face-to-face classes. However, faculty who teach on-line, or even hybrid (1/2 face-to-face, 1/2 on-line) courses may not know how to apply the same concepts. Universal Instructional Design is a method that incorporates knowledge of all types of learning styles, and how to apply them in any environment. This paper will examine the seven principles of Universal Instructional Design and how it can be applied to all types of learning styles. The paper will present practical suggestions and examples of how to apply UID to on-line and hybrid courses.
Lovelace & Babbage and the Creation of the 1843 'Notes'
Authors: John Fuegi, Jo Francis
Venue: IEEE Annals of the History of Computing (2003)

Augusta Ada Lovelace worked with Charles Babbage to create a description of Babbage's unbuilt invention, the Analytical Engine, a highly advanced mechanical calculator often considered a forerunner of the electronic calculating computers of the 20th century. Ada Lovelace's "Notes," describing the Analytical Engine, published in Taylor's Scientific Memoirs in 1843, contained a ground-breaking description of the possibilities of programming the machine to go beyond number-crunching to "computing" in the wider sense in which we understand the term today. This article expands on research first presented by the authors in their documentary film, To Dream Tomorrow.
Embedding Partial 4-cycle Systems of Arbitrary Index
Authors: April Parker, C. A. Rodger
Venue: Graphs and Combinatorics (2008)

Recently, Lindner showed that every partial 4-cycle system of order n and index 1 could be embedded in a 4-cycle system of order &#x03bd; and index 1 with v &#x2264;&#x00a0;2n +&#x00a0;15. While the technique he used does not immediately extend to any higher index, here we develop his ideas to show that every partial 4-cycle system of order n and index &#x03bb; can be embedded in a 4-cycle system of order v and index &#x03bb; for all &#x03bb;-admissible $$\nu \geq 8 \lceil n /4 \rceil + 7, \nu \ne 8 \lceil n /4 \rceil + 8$$. This improves on the best known bounds of v =&#x00a0;4n and v =&#x00a0;8n&#x00a0;+&#x00a0;1 when &#x03bb; > 1 is even and odd respectively.
Finite Eilenberg Machines
Authors: Benoît Razet
Venue: Proceedings of the 13th international conference on Implementation and Applications of Automata (2008)

Eilenberg machines define a general computational model. They are well suited to the simulation of problems specified using finite state formalisms such as formal languages and automata theory. This paper introduces a subclass of them called finite Eilenberg machines. We give a formal description of complete and efficient algorithms which permit the simulation of such machines. We show that our finiteness condition ensures a correct behavior of the simulation. Interpretations of this condition are studied for the cases of non-deterministic finite automata (NFA) and transducers, leading to applications to computational linguistics. The given implementation provides a generic simulation procedure for any problem encoded as a composition of finite Eilenberg machines. 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
Ranking People Based on Metadata Analysis of Search Results
Authors: Qiang Ma, Masatoshi Yoshikawa
Venue: Proceedings of the 2008 international workshops on Web Information Systems Engineering (2008)

Person search is one of the most popular search types on the Web. Most of the conventional technologies for person search focused on mapping the person name to a specific person (i.e. referents). In contrast, in this paper, we propose a novel ranking measure called famousness for person search. We use the notion of famousness for ranking people according to how well-known they are. Intuitively, famousness score is computed by analyzing the metadata of search results returned by a search engine. The metadata used in our method include URL, snippet, and the number of search results. To compute the famousness score of a person, first, we cluster the search results by using their metadata. Second, we compute the deviations in the size and number of such clusters. If the related Web pages of a person can be grouped into many large clusters of similar size, it looks like that person has been mentioned in many Web pages from various domains and that s/he is well known. In addition, we compare the clusters of search results with those of other people. Persons having more and larger clusters are given higher famousness scores. We also show experimental results to validate the ranking method based on the famousness score.
Explicit Proofs in Formal Provability Logic
Authors: Evan Goris
Venue: Proceedings of the international symposium on Logical Foundations of Computer Science (2007)

In this paper we answer the question what implicit proof assertions in the provability logic GL can be realized by explicit proof terms. In particular we show that the fragment of GL which can be realized by generalized proof terms of GLA is exactly S4 ¿ GL and equals the fragment that can be realized by proof-terms of LP. In the final sections of this paper we establish the disjunction property for GLA and give an axiomatization for GL ¿ S4. 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 Strategy for the Selection of Solutions of the Pareto Front Approximation in Multi-objective Clustering Approaches
Authors: Katti Faceli, Marcilio C. P. de Souto, André C. P. L. F. de Carvalho
Venue: Proceedings of the 2008 10th Brazilian Symposium on Neural Networks (2008)

One of the advantages of Pareto-based multi-objective genetic algorithms for clustering, when compared to classical clustering algorithms, is that, instead of a single solution (partition), they give as an output a set of solutions (approximation of the Pareto front or Pareto front, for short). However, such a set could be very large (e.g., hundreds of partitions) and, consequently, difficult to be analyzed manually. We present a selection strategy, based on the corrected Rand index, that aims at recommending, as final solution for Pareto-based multi-objective genetic algorithm approaches, a subset of partitions from the Pareto front. This subset should be much smaller than the the latter and, at the same time, keep the quality and the diversity of the partitions. In order to test our strategy, we develop a study of case in which we apply the strategy to the sets of solutions obtained with the Multi-Objective Clustering Ensemble algorithm (MOCLE) in the context of several data sets.
The moderator as an emerging democratic intermediary: The role of the moderator in Internet discussions about public issues
Authors: Arthur R. Edwards
Venue: Information Polity (2002)

A common approach towards the role of the moderator in Internet discussions is to see him as a filter. In this article I want to show that the moderator in government-initiated Internet discussions about public issues can be seen as a democratic intermediary, and that this role has the potential to enhance the quality of those discussions as forms of deliberative democracy. I develop a conceptual model of the management of Internet discussions. Five cases of Dutch Internet discussions about public issues are analyzed. The filter function of moderation appears to be of minor importance. Moderators do a lot more. They manage discussions. Particularly, they contribute to the interactivity and openness of discussions and to the accessibility of public administration and institutional politics. In most of the cases described, there had been independent, `third party' moderation. As governments gain more experience with the Internet, moderation may shift to governmental agencies. In this perspective, it is important to stress the transparency and to care for the negotiableness of moderation.
A Cluster-Based Classification Approach to Semantic Role Labeling
Authors: Necati E. Ozgencil, Nancy Mccracken, Kishan Mehrotra
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

In this paper, a new approach for multi-class classification problems is applied to the Semantic Role Labeling (SRL) problem, which is an important task for natural language processing systems to achieve better semantic understanding of text. The new approach applies to any classification problem with large feature sets. Data is partitioned using clusters on a subset of the features. A multi-label classifier is then trained individually on each cluster, using automatic feature selection to customize the larger feature set for the cluster. This algorithm is applied to the Semantic Role Labeling problem and achieves improvements in accuracy for both the argument identification classifier and the argument labeling classifier.