ppxscal/embedding_network huggingface dataset:
Investigation of Different PV Distributions in Digital Breast Tomosynthesis (DBT) Mammography
Authors: Yiheng Zhang, Heang-Ping Chan, Mitchell M. Goodsitt, Andrea Schmitz, Jeffrey W. Eberhard, Bernhard E. Claus
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

Digital Breast Tomosynthesis (DBT) Mammography is an emerging technique that has the potential to improve breast cancer detection. In DBT, low-dose mammograms are acquired at a number of projection angles over a limited range and the 3D breast volume is reconstructed. In this study, we investigated the effect of different distributions of projection-view (PV) images that included different angular range and angular spacing on the reconstruction image quality. A GE prototype DBT system was used to acquire a total of 21 PVs in 3º increments over a ±30º range, from which multiple subsets containing the same number of 11 PV images were selected. A custom-built breast phantom and a selected patient case were used to evaluate the image quality. For breast phantom study, the contrast-to-noise ratio (CNR), the normalized line profiles of test objects, and an artifact spread function (ASF) were used as performance measures to compare the results for the different subsets and for the full set. The simultaneous algebraic reconstruction technique (SART) was used to reconstruct the DBT under all conditions. Our results demonstrated that large DBT angular range gave superior CNR and ASF for masses and less interplane blurring for high-density objects. Narrow angular range favors in-plane edge sharpness for high-density objects.
Visual Mining of Association Rules
Authors: Dario Bruzzese, Cristina Davino
Venue: Visual Data Mining: Theory, Techniques and Tools for Visual Analytics (2008)

Association Rules are one of the most widespread data mining tools because they can be easily mined, even from very huge database, and they provide valuable information for many application fields such as marketing, credit scoring, business, etc. The counterpart is that a massive effort is required (due to the large number of rules usually mined) in order to make actionable the retained knowledge. In this framework vizualization tools become essential to have a deep insight into the association structures and interactive features have to be exploited for highlighting the most relevant and meaningful rules.
Toward Optimizing Particle-Simulation Systems
Authors: Hai Jiang, Hung-Chi Su, Bin Zhang
Venue: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007 (2007)

Optimized event-driven particle collision simulation is on demand to study the behavior of systems consisted of moving objects. This paper discusses the design and implementation issues of such simulation systems with various optimizations such as discrete event handling, Lazy Determination Strategy (LDS), and optimal cell number/size selection to overcome the delay caused by dynamical dependencies among collisions. Quantitative analyses and experiment results are provided to illustrate the performance gains acquired from these optimizations.
Using ANNs to predict a subject's response based on EEG traces
Authors: Vito Logar, Aleš Belič, Bla Koritnik, Simon Brean, Janez Zidar, Rihard Karba, Drago Matko
Venue: Neural Networks (2008)

Numerous reports have shown that performing working-memory tasks causes an elevated rhythmic coupling in different areas of the brain; it has been suggested that this indicates information exchange. Since the information exchanged is encoded in brain waves and measurable by electroencephalography (EEG) it is reasonable to assume that it can be extracted with an appropriate method. In our study we made an attempt to extract the information using an artificial neural network (ANN), which can be considered as a stimulus-response model with a state observer. The EEG was recorded from three subjects while they performed a modified Sternberg task that required them to respond to each task with the answer ''true'' or ''false''. The study revealed that a stimulus-response model can successfully be identified by observing phase-demodulated theta-band EEG signals 1 s prior to a subject's answer. The results also showed that it was possible to predict the answers from the EEG signals with an average reliability of 75% for all the subjects. From this we concluded that it is possible to observe the system states and thus predict the correct answer using the EEG signals as inputs.
Real-Time Testing with TTCN-3
Authors: Diana Alina Serbanescu, Victoria Molovata, George Din, Ina Schieferdecker, Ilja Radusch
Venue: Proceedings of the 20th IFIP TC 6/WG 6.1 international conference on Testing of Software and Communicating Systems: 8th International Workshop (2008)

Reactive real-time software is used when safety is the issue and the margin for errors is narrow. Such software is used in automotive, avionics, air traffic control, space shuttle control, medical equipment, nuclear power stations, etc. As the timeliness of those systems is critical, it needs to be assured and tested. However, real-time properties require automated tests as manual tests are untimely and imprecise. This paper reviews Testing and Test Control Notation Version 3 (TTCN-3) as a means for real-time testing and proposes extensions to enable real-time test systems in TTCN-3. Small examples demonstrate the usage of the new constructs. Real-time operating systems are analyzed and reviewed, to enable the realization of real-time test systems based on TTCN-3.
Simple Dynamic Particle Swarms without Velocity
Authors: Jorge Peña
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

The standard particle swarm optimiser uses update rules including both multiplicative randomness and velocity. In this paper, we look into a general particle swarm model that removes these two features, and study it mathematically. We derive the recursions and fixed points for the first four moments of the sampling distribution, and analyse the transient behaviour of the mean and the variance. Then we define actual instances of the algorithm by coupling the general update rule with specific recombination operators, and empirically test their optimisation efficiency.
Managing Reputation over MANETs
Authors: G. Bella, G. Costantino, S. Riccobene
Venue: Proceedings of the 2008 The Fourth International Conference on Information Assurance and Security (2008)

The use of small portables and mobile devices has made MANETs (Mobile Ad Hoc Networks) very popular. A MANET is a network composed by a group of mobile nodes without any fixed device or a central coordination. They work in an open net and their collaboration is the sole means to allow communications and the survival of the MANET itself. A critical issue is to assess the behaviour of the nodes that participate in the network, possibly identifying selfish conduct that can compromise the functioning of the system. This paper shows a method to evaluate the behaviour of all nodes by establishing a reputation value that represents the trustworthiness of each node. A protocol is presented to calculate the reputation of a node by locally observing the node from another one, and then tuning this intermediate value with additional observations from other participants. When the reputation value of a node is available, it is circulated and distributed uniformly over the network. This reputation protocol is viable. Each node can efficiently calculate the reputation values of its neighbours and then of all network nodes. A variety of simulations conducted using the network simulator NS-2 strongly support these claims.
Persian Writer Identification Using Extended Gabor Filter
Authors: Behzad Helli, Mohsen Ebrahimi Moghadam
Venue: Proceedings of the 5th international conference on Image Analysis and Recognition (2008)

Writer identification using handwritten documents is an interesting field in image processing and machine vision. Many researchers have presented methods to do this, but most of these methods are based on English language. In this paper we have presented a method to identify writer of Persian (Farsi) handwritten documents. The proposed method is based on new filter which we called it extended Gabor filter. This method has no constraint on input data and the experimental results showed that the proposed method worked well.
A policy-aware switching layer for data centers
Authors: Dilip A. Joseph, Arsalan Tavakoli, Ion Stoica
Venue: ACM SIGCOMM Computer Communication Review (2008)

Data centers deploy a variety of middleboxes (e.g., firewalls, load balancers and SSL offloaders) to protect, manage and improve the performance of applications and services they run. Since existing networks provide limited support for middleboxes, administrators typically overload path selection mechanisms to coerce traffic through the desired sequences of middleboxes placed on the network path. These ad-hoc practices result in a data center network that is hard to configure and maintain, wastes middlebox resources, and cannot guarantee middlebox traversal under network churn. To address these issues, we propose the policy-aware switching layer or PLayer, a new layer-2 for data centers consisting of inter-connected policy-aware switches or pswitches. Unmodified middleboxes are placed off the network path by plugging them into pswitches. Based on policies specified by administrators, pswitches explicitly forward different types of traffic through different sequences of middleboxes. Experiments using our prototype software pswitches suggest that the PLayer is flexible, uses middleboxes efficiently, and guarantees correct middlebox traversal under churn.
Finding the Optimal Path in 3D Spaces Using EDAs --- The Wireless Sensor Networks Scenario
Authors: Bo Yuan, Maria Orlowska, Shazia Sadiq
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The effective communication ranges of sensors are represented by spheres with varying diameters. The task of finding the shortest travelling path in this scenario can be regarded as an instance of a class of problems called Travelling Salesman Problem with Neighbourhoods (TSPN), which is known to be NP-hard. In this paper, we propose a novel approach to this problem using Estimation of Distribution Algorithms (EDAs), which can produce significantly improved results compared to an approximation algorithm.
Enriching network security analysis with time travel
Authors: Gregor Maier, Robin Sommer, Holger Dreger, Anja Feldmann, Vern Paxson, Fabian Schneider
Venue: Proceedings of the ACM SIGCOMM 2008 conference on Data communication (2008)

In many situations it can be enormously helpful to archive the raw contents of a network traffic stream to disk, to enable later inspection of activity that becomes interesting only in retrospect. We present a Time Machine (TM) for network traffic that provides such a capability. The TM leverages the heavy-tailed nature of network flows to capture nearly all of the likely-interesting traffic while storing only a small fraction of the total volume. An initial proof-of-principle prototype established the forensic value of such an approach, contributing to the investigation of numerous attacks at a site with thousands of users. Based on these experiences, a rearchitected implementation of the system provides flexible, highperformance traffic stream capture, indexing and retrieval, including an interface between the TM and a real-time network intrusion detection system (NIDS). The NIDS controls the TM by dynamically adjusting recording parameters, instructing it to permanently store suspicious activity for offline forensics, and fetching traffic from the past for retrospective analysis. We present a detailed performance evaluation of both stand-alone and joint setups, and report on experiences with running the system live in high-volume environments.
Automation, 1955: A Retrospective
Authors: Gordon S. Brown, Norbert Wiener
Venue: IEEE Annals of the History of Computing (1984)

MIT Club talks, February 2, 1955. In the introduction, mention of the awareness of companies that those whose jobs would be replaced by automation would have to be retrained in other areas is made.
Spectral algorithms for supervised learning
Authors: L. Lo Gerfo, L. Rosasco, F. Odone, E. De Vito, A. Verri
Venue: Neural Computation (2008)

We discuss how a large class of regularization methods, collectively known as spectral regularization and originally designed for solving ill-posed inverse problems, gives rise to regularized learning algorithms. All of these algorithms are consistent kernel methods that can be easily implemented. The intuition behind their derivation is that the same principle allowing for the numerical stabilization of a matrix inversion problem is crucial to avoid overfitting. The various methods have a common derivation but different computational and theoretical properties. We describe examples of such algorithms, analyze their classification performance on several data sets and discuss their applicability to real-world problems.
A log periodic antenna: analysis, design, and simulation for mobile communication bands
Authors: Jaleel Azeez Hamadameen
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

The Log-Periodic Loop Antenna (LPA) is investigated as a new type of antenna, whose properties vary periodically with the logarithm of frequency, and provides wide bandwidth, broad beam width, and high gain. This antenna has smaller transverse dimensions than another antenna types. In this paper the analysis, design, and simulation of log periodic dipole antenna (LPDA) is presented, which is suitable and particular for mobile communication bands from 1150 MHz up to 2450 MHz. ZPLOTS simulation program shows acceptable results and confirm the theoretic basics.
Numerical simulation of the effects of secondary flow and boundary retention on contaminant dispersion
Authors: Shalu Singhal, Girija Jayaraman, S. R. K. Iyengar
Venue: Journal of Computational Methods in Sciences and Engineering (2006)

The secondary flow and dispersion of a tracer substance in a fluid flowing through a curved tube are studied numerically. The system consists of an infinitely long conduit defined by two concentric curved circular pipes. Thus the two phases correspond to a flowing fluid phase and the annular wall comprised of a stationary homogenous medium. The solute is soluble in the annular region and is assumed to satisfy a linear equilibrium relationship at the interface. Flow in the fluid phase is calculated using the finite difference scheme as described by Collins and Dennis [9]. The scheme is of second order accuracy with respect to grid sizes over the entire laminar flow region and reveals the asymptotic nature of the solution for large values of Dean number D. Further, a central difference scheme is used to solve the convection diffusion equation in both the phases with the condition that the injective solute is highly soluble in the wall layer according to a linear equilibrium relationship at the interface. Results for small Dean number are first verified with our earlier results (Jayaraman et al. [17]) which were based on Dean's solution [12,13]. The numerical calculations are then extended for larger Dean number and Schmidt number. The results are consistent with experimental results that the influence of secondary flows on dispersion is reduced if the tracer is very soluble in the wall. It is found that the effective longitudinal diffusivity falls below its straight tube value by an amount, which depends on the absorption coefficient, Dean number and the diffusivity in the wall. For large Dean number dispersion becomes negligible.
Grounded Conceptual Graph Models
Authors: Harry S. Delugach, Daniel M. Rochowiak
Venue: Proceedings of the 16th international conference on Conceptual Structures: Knowledge Visualization and Reasoning (2008)

The ability to represent real-world objects is an important feature of a practical knowledge system. Most knowledge systems involve informal or ad-hoc mappings from their internal symbols to objects and concepts in their environment. This work introduces a framework for formally associating symbols to their meanings, a process we call grounding. Two kinds of grounding are discussed with respect to conceptual graphs --- active grounding, which involves actors to provide mappings to the environment, and terminological grounding, which involves actors that establish the basic elements of meaning with respect to a subject field's agreed-upon terminology. The work incorporates active knowledge systems and international terminological standards.
A combinatorial proof of a Weyl type formula for hook Schur polynomials
Authors: Jae-Hoon Kwon
Venue: Journal of Algebraic Combinatorics: An International Journal (2008)

In this paper, we present a simple combinatorial proof of a Weyl type formula for hook Schur polynomials, which was obtained previously by other people using a Kostant type cohomology formula for $\frak{gl}_{m|n}$ . In general, we can obtain in a combinatorial way a Weyl type character formula for various irreducible highest weight representations of a Lie superalgebra, which together with a general linear algebra forms a Howe dual pair.
Positive periodic solutions of a periodic neutral delay logistic equation with impulses
Authors: Yongkun Li
Venue: Computers Mathematics with Applications (2008)

By using a fixed point theorem of strict-set-contraction, some criteria are established for the existence of positive periodic solutions for a periodic neutral functional differential equation with impulses of the form {dx(t)dt=x(t)[a(t)-@?i=1mb"i(t)x(t-@t"i(t))-@?j=1nc"j(t)x^'(t-@s"j(t))],x(t"k^+)-x(t"k)=-I"k(x(t"k)),k=1,2,....
Pros and Cons of a Type-Shifting Approach to Russian Genitive of Negation
Authors: Barbara H. Partee, Vladimir Borschev
Venue: Logic, Language, and Computation: 6th International Tbilisi Symposium on Logic, Language, and Computation,TbiLLC 2005 Batumi, Georgia, September 12-16, 2005. Revised Selected Papers (2007)

In our work on the Russian Genitive of Negation (Borschev and Partee 1998a, 1998b, 2002a, 2002b, 2002c, Partee and Borschev 2002, 2004b, In press), we address the semantics of the Genitive of Negation construction and the interplay of lexical, compositional, and contextual factors. In this paper we focus on one interesting semantic proposal that has arisen recently (Kagan 2005, Partee and Borschev 2004b) and arguments both in favor of it and against it. We consider the matter unresolved and worth continued investigation. In this introductory section we review the basic facts of the Genitive of Negation, and some of the key points of existing proposals including our own. In Section 2 we discuss our notion of "Perspective Structure" and the question of where it belongs in the grammar, concluding that it is probably best viewed as a semantic correlate of diathesis shift. In Section 3 we address the principal issue of this paper, the possibility that the relevant diathesis shift in this case involves the demotion of the Genitive-marked NP from a normal referential type e to a property type, <e,t>, raising arguments both for and against such a proposal and pointing to further research which will need to be done.
A social agent pedestrian model
Authors: Andrew Park
Venue: Computer Animation and Virtual Worlds (2008)

This paper presents a social agent pedestrian model based on experiments with human subjects. Research studies of criminology and environmental psychology show that certain features of the urban environment generate fear in people, causing them to take alternate routes. The Crime Prevention Through Environmental Design (CPTED) strategy has been implemented to reduce fear of crime and crime itself. Our initial prototype of a pedestrian model was developed based on these findings of criminology research. In the course of validating our model, we constructed a virtual environment (VE) that resembles a well-known fear-generating area where several decision points were set up. 60 human subjects were invited to navigate the VE and their choices of routes and comments during the post interviews were analyzed using statistical techniques and content analysis. Through our experimental results, we gained new insights into pedestrians' behavior and suggest a new enhanced and articulated agent model of a pedestrian. Our research not only provides a realistic pedestrian model, but also a new methodology for criminology research. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Sorting Cancer Karyotypes by Elementary Operations
Authors: Michal Ozery-Flato, Ron Shamir
Venue: Proceedings of the international workshop on Comparative Genomics (2008)

Since the discovery of the "Philadelphia chromosome" in chronic myelogenous leukemia in 1960, there is an ongoing intensive research of chromosomal aberrations in cancer. These aberrations, which result in abnormally structured genomes, became a hallmark of cancer. Many studies give evidence to the connection between chromosomal alterations and aberrant genes involved in the carcinogenesis process. An important problem in the analysis of cancer genomes, is inferring the history of events leading to the observed aberrations. Cancer genomes are usually described in form of karyotypes, which present the global changes in the genomes' structure. In this study, we propose a mathematical framework for analyzing chromosomal aberrations in cancer karyotypes. We introduce the problem of sorting karyotypes by elementary operations, which seeks for a shortest sequence of elementary chromosomal events transforming a normal karyotype into a given (abnormal) cancerous karyotype. Under certain assumptions, we prove a lower bound for the elementary distance, and present a polynomial-time 3-approximation algorithm. We applied our algorithm to karyotypes from the Mitelman database, which records cancer karyotypes reported in the scientific literature. Approximately 94% of the karyotypes in the database, totalling 57,252 karyotypes, supported our assumptions, and each of them was subjected to our algorithm. Remarkably, even though the algorithm is only guaranteed to generate a 3-approximation, it produced a sequence whose length matches the lower bound (and hence optimal) in 99.9% of the tested karyotypes.
Constructing Legal Arguments with Rules in the Legal Knowledge Interchange Format (LKIF)
Authors: Thomas F. Gordon
Venue: Computable Models of the Law: Languages, Dialogues, Games, Ontologies (2008)

The Legal Knowledge Interchange Format (LKIF), being developed in the European ESTRELLA project, defines a knowledge representation language for arguments, rules, ontologies, and cases in XML. In this article, the syntax and argumentation-theoretic semantics of the LKIF rule language is presented and illustrated with an example based on German family law. This example is then applied to show how LKIF rules can be used with the Carneades argumentation system to construct, evaluate and visualize arguments about a legal case.