ppxscal/embedding_network huggingface dataset:
A Probabilistic Approach for Network Intrusion Detection
Authors: Kok-Chin Khor, Choo-Yee Ting, Somnuk-Phon Amnuaisuk
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This study aims to propose a probabilistic approach for detecting network intrusions using Bayesian Networks (BNs). Three variations of BN, namely, Naïve Bayesian Network (NBC), Learned BN, and hand-crafted BN, were evaluated and from which, an optimal BN was obtained. A standard dataset containing 494020 records, a category for normal network traffics, and four major attack categories (Denial of Service, Probing, Remote to Local, User to Root and Normal), were used in this study. The dataset went through an 80-20 split to serve the training and testing phases. 80% of the dataset were treated with a feature selection algorithm to obtain a set of features, from which the three BNs were constructed. During the evaluation phase, the remaining 20% of the dataset were used to obtain the classification accuracies of the BNs. The results show that the hand-crafted BN, in general, has outperformed NBC and Learned BN.
System implications of integrated photonics
Authors: Norman P. Jouppi
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

Micron-scale photonic devices integrated with standard CMOS processes have the potential to dramatically increase system bandwidths, performance, and configuration flexibility while reducing system power. I first describe some recent developments in silicon nanophotonic technology, such as microring resonators. Small devices have many advantages: reduced power, increased density, and increased speed. By integrating many thousands of these devices on a chip, photonics could potentially be used for most high-speed off-chip and global on-chip communication. Integrated photonics has many advantages at the board and rack scale as well. Recent high-speed board-level electrical signaling (>2.5GHz) precludes the use of multi-drop busses or communication over long distances on ordinary inexpensive PC board materials. By using photonics, high fan-out and high-fan-in bus structures can be built. Due to the low loss of optical signals versus distance, these structures can even be distributed over rack-scale distances. This dramatically increases system flexibility while reducing interconnect power. As an example of the potential impact of photonics, I describe a system architecture for the 2017 time frame we call Corona. Corona is a 3D many-core architecture that uses nanophotonic communication for both inter-core communication and off-stack communication to memory or I/O devices. Dense wavelength division multiplexed optically connected memory modules provide 10 terabyte per second memory bandwidth. A photonic crossbar fully interconnects its 256 low-power multithreaded cores at 20 terabyte per second bandwidth. We believe that in comparison with an electrically-connected many-core alternative, Corona can provide 2 to 6 times more performance on many memory intensive workloads, while simultaneously significantly reducing power.
An Energy Efficient Routing Scheme in Wireless Sensor Networks
Authors: Chiu-Kuo Liang, Yu-Jie Huang, Jian-Da Lin
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In wireless sensor networks, it is an important task to periodically collect data from an area of interest for time-sensitive applications. The sensed data must be gathered and transmitted to a base station for further processing to meet the end-user queries. Since the network consists of low-cost nodes with limited battery power, it is a challenging task to design an efficient routing scheme that can minimize delay and offer good performance in energy efficiency, and long network lifetimes. In this paper, we propose a two layer hierarchical routing protocol, called Cluster-based Minimal Spanning Tree with Degree-Constrained (CMST-DC), to collect information efficiently. CMST-DC is efficient in the ways that it ensures maximal utilization of network energy, it makes the lifetime of the network longer, as well as it takes much lower time to complete a round. Simulation results show that CMST-DC performs better than other hierarchical routing protocols, such as Low-Energy Adaptive Clustering Hierarchy (LEACH) and Group-based Sensor Network (GSEN). In addition, CMST-DC is completely self-configurable and robust for any changes in network topology.
On-chip cache device scaling limits and effective fault repair techniques in future nanoscale technology
Authors: David Roberts, Nam Sung Kim, Trevor Mudge
Venue: Microprocessors Microsystems (2008)

In this study, we investigate different cache fault-tolerance techniques to determine which will be most effective when on-chip memory cell defect probabilities exceed those of current technologies, which is highly anticipated in processor on-chip caches manufactured with future nanometer scale technologies. Our most significant finding from this study is that the devices in on-chip memory cells cannot be scaled at the same rate as devices in logic circuits due to the increasing number of erroneous memory cells with voltage scaling, requiring strong fault-tolerance techniques. Second, we propose a technique to minimize performance impacts under aggressive technology and voltage scaling. It works by merging pairs of faulty cache lines into good lines and performs better than TMR at high error rates. We also estimate up to 28% energy savings at low voltage, relative to a recent fault-tolerance scheme [A. Agarwal et al. A process-tolerant cache architecture for improved yield in nanoscale technologies. IEEE Trans. VLSI Syst. 13(1) (2005) 27-38].
Evaluation measures for preference judgments
Authors: Ben Carterette, Paul N. Bennett
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

There has been recent interest in collecting user or assessor preferences, rather than absolute judgments of relevance, for the evaluation or learning of ranking algorithms. Since measures like precision, recall, and DCG are defined over absolute judgments, evaluation over preferences will require new evaluation measures that explicitly model them. We describe a class of such measures and compare absolute and preference measures over a large TREC collection.
Computational linguistics for metadata building
Authors: Judith L. Klavans, Carolyn Sheffield, Jimmy Lin, Tandeep Sidhu
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

In this paper, we describe a downloadable text-mining tool for enhancing subject access to image collections in digital libraries.
Using recursive least squares estimator for modelling a speech signal
Authors: A. Maddi, A. Guessoum, D. Berkani
Venue: Proceedings of the 6th WSEAS International Conference on Signal, Speech and Image Processing (2006)

In this paper we will present a detailed study of recursive least squares method, and then we choose an application of this algorithm to identify the parameters of the autoregressive model AR associated to the speech signal. The technique proposed here makes it possible to identify the parameters of the autoregressive moving average model ARMA with unbiased estimates, this method is based on the minimization of a quadratic criterion.
Lower bounds for the stable marriage problem and its variants
Authors: C. Ng
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

An instance of the stable marriage problem of size n involves n men and n women. Each participant ranks all members of the opposite sex in order of preference. A stable marriage is a complete matching M=((m/sub 1/, w/sub i1/), (m/sub 2/, w/sub i2/), . . ., (m/sub n/, w/sub in/)) such that no unmatched man and woman prefer each other to their partners in M. A pair (m/sub i/, w/sub j/) is stable if it is contained in some stable marriage. The problem of determining whether an arbitrary pair is stable in a given problem instance is studied. It is shown that the problem has a lower bound of Omega (n/sup 2/) in the worst case. As corollaries of the results, the lower bound of Omega (n/sup 2/) is established for several related stable marriage problems, including that of finding a stable marriage for any given problem instance.
MODIS land surface temperature data detects thermal anomaly preceding 8 October 2005 Kashmir earthquake
Authors: S. K. Panda, S. Choudhury, A. K. Saraf, J. D. Das
Venue: International Journal of Remote Sensing (2007)

During the morning (03:50:40 UTC) of 8 October 2005 a major (M w 7.6) shallow focus (26 km) earthquake struck Kashmir (Himalayan region). Its epicentre was located 10 km NNE of Muzaffarabad (USGS 2005, Magnitude 7.6-Pakistan, available online at http://earthquake.usgs.gov/eqcenter/eqinthenews/2005/usdyae/). The present manuscript is an attempt to study the development of thermal anomaly in land surface temperature (LST) preceding this earthquake. Using data from Moderate Resolution Imaging Spectroradiometer (MODIS) onboard National Aeronautics and Space Administration (NASA) Terra satellite, the daily daytime LST images have been analysed for the correlation between LST variations and Kashmir earthquakes. An evident correlation of thermal anomaly in LST that is apparently related to pre-seismic activity has been identified. An attempt has also been made to quantify the change in LST (in °C) with reference to previous day temperature values and background data (MODIS LST data from 2000-2004). A 4-8°C rise in LST to the south of the earthquake epicentre has been observed seven days before the major event. Air temperature data from two meteorological stations (Islamabad and Srinagar) also supports the observations made through MODIS LST data. The role of terrain parameters like rock types, vegetation and topography upon the spatial and temporal variations of anomalous temperature area have been studied.
Simulation of vertical wind profile under neutral conditions
Authors: T. X. Yue, W. Wang, Q. Yu, Z. L. Zhu, S. H. Zhang, R. H. Zhang, Z. P. Du
Venue: International Journal of Remote Sensing (2007)

After analysing formulations of the horizontal wind velocity above a non-uniform underlying surface, it is found that the mean height of roughness elements, fractional vegetation cover and leaf area index are the most essential parameters of vertical wind profile under neutral conditions. By using Landsat-5 data, every-10-days observed data in the field, the every-10-days Normalized Difference Vegetation Index (NDVI) data from NOAA-14 meteorological satellite, 1 : 10 000 land-use data, and 1 : 10 000 topographical data, the mean height, leaf area index and fractional vegetation cover of wheat at Yucheng Integrated Agricultural Experiment Station are simulated as functions of NDVI. Then, hourly horizontal wind velocity at a height of 4 m during the period from 21:05 on 5 March 2000 to 7:05 on 24 May 2000 is calculated, for which hourly observed horizontal wind velocity at a height of 2 m is first used to simulate the wheat parameter of the dimensionless constant. The results show that the simulated velocity is almost identical to the observation velocity at a height of 4 m.
High accuracy finite difference scheme for three-dimensional microscale heat equation
Authors: Akil J. Harfash
Venue: Journal of Computational and Applied Mathematics (2008)

A compact finite difference scheme is developed to the three-dimensional microscale heat transport equation. This new scheme is fourth order in space and second order in time. It is proved to be unconditionally stable with respect to initial values. Numerical results are provided for comparison testing purpose.
Peer-it: Stick-on solutions for networks of things
Authors: A. Ferscha, M. Hechinger, A. Riener, M. dos Santos Rocha, A. Zeidler, M. Franz, R. Mayrhofer
Venue: Pervasive and Mobile Computing (2008)

An integrated, autonomous stick-on computing platform is proposed, consisting of (i) the Peer-it stick-on, multi-sensor, multi-actuator computer hardware, (ii) the Peer-it component-based software framework, and (iii) the Peer-it profile markup language PeerML, supporting spontaneous interaction among such platforms. The platform implements Peer-to-Peer computing principles in a self-contained, miniaturized, universal and scalable way, giving raise for application scenarios where the real-world artefacts like e.g. machines, tools or appliances-literally every thing-equipped with Peer-it technology can operate in spontaneously interacting, goal-oriented ensembles. Technically, preferences (like capabilities and goals) and context (like time, geo-position, owner, environmental conditions, etc.) of peers are kept as a profile encoded in PeerML in the local memory of Peer-its, and carried along wherever they move in space. Once peers come into spatial proximity of each other, profiles are exchanged via wireless communication, and the ''similarity'' of preferences is analyzed. In the case of ''matching'' preferences, an associated application is notified on both peers. Besides a fully functional autonomous hardware platform integrating multiple sensors, actuator arrays and wireless communication technologies, the Peer-it stick-on computer, a low-memory footprint, OSGi compliant Peer-it software framework has been implemented. We demonstrate in a flexible manufacturing systems (FMS) scenario, how the Peer-it technology can improve over centralized FMSs with respect to fault tolerance, scalability, flexibility in reconfiguration, productivity and efficiency.
Prediction of compressive and tensile strength of limestone via genetic programming
Authors: Adil Baykasoğlu, Hamza Güllü, Hanifi Çanakçı, Lale Özbakır
Venue: Expert Systems with Applications: An International Journal (2008)

Accurate determination of compressive and tensile strength of limestone is an important subject for the design of geotechnical structures. Although there are several classical approaches in the literature for strength prediction their predictive accuracy is generally not satisfactory. The trend in the literature is to apply artificial intelligence based soft computing techniques for complex prediction problems. Artificial neural networks which are a member of soft computing techniques were applied to strength prediction of several types of rocks in the literature with considerable success. Although artificial neural networks are successful in prediction, their inability to explicitly produce prediction equations can create difficulty in practical circumstances. Another member of soft computing family which is known as genetic programming can be a very useful candidate to overcome this problem. Genetic programming based approaches are not yet applied to the strength prediction of limestone. This paper makes an attempt to apply a promising set of genetic programming techniques which are known as multi expression programming (MEP), gene expression programming (GEP) and linear genetic programming (LGP) to the uniaxial compressive strength (UCS) and tensile strength prediction of chalky and clayey soft limestone. The data for strength prediction were generated experimentally in the University of Gaziantep civil engineering laboratories by using limestone samples collected from Gaziantep region of Turkey.
A sub-linear time distributed algorithm for minimum-weight spanning trees
Authors: J. A. Garay, S. Kutten
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

This paper considers the question of identifying the parameters governing the behavior of fundamental global network problems. Many papers on distributed network algorithms consider the task of optimizing the running time successful when an O(n) bound is achieved on an n-vertex network. We propose that a more sensitive parameter is the network's diameter Diam. This is demonstrated in the paper by providing a distributed minimum-weight spanning tree algorithm whose time complexity is sub-linear in n, but linear in Diam (specifically, O(Diam+n/sup 0.614/)). Our result is achieved through the application of graph decomposition and edge elimination techniques that may be of independent interest.
Analysing users' access logs in Moodle to improve e learning
Authors: Cássia Blondet Baruque, Marília A. Amaral, Alexandre Barcellos, João Carlos da Silva Freitas, Carlos Juliano Longo
Venue: Proceedings of the 2007 Euro American conference on Telematics and information systems (2007)

In this work the UFSC (Federal University of Santa Catarina) and the FGV-RJ (Funda&ccedil;&atilde;o Get&uacute;lio Vargas do Rio de Janeiro) jointly propose the use of a data mining tool to support the analysis of trends, students profiles, as well as to estimate or foresee the usability level of courses being offered, via Moodle, in the Education area. The study carried out by UFSC on the Moodle database allowed a deep understanding of its database, thus making it easier for the Moodle community to execute important tasks, such as the maintenance of the Moodle database, its adaptation following an institutional customization, and, also, a data mart project by the FGV-Online Program to make the necessary analysis possible. In the end of this paper, an example on its applicability is presented, using the association rules technique. Once a data mart oriented to the analysis of the system's usability is developed, various analyses with different objectives can be executed using the database. Some may use the method proposed here or others, including different data mining approaches, such as clustering, neural networks etc. As such, a new contribution is given to the Moodle community.
An Adaptive Configuration for Agent-Based Supply Network
Authors: Khaled Ghoneim, Jamal Bentahar
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

A supply network is comprised of multiple heterogeneous subsystems gathered in a dynamic coalition to collaboratively provide an outcome. For a supply network to be effective in an open and competitive environment, it has to be scalable. An adaptive reconfiguration strategy is needed in order to respond effectively to the market changes, by dynamically creating and maintaining supply network’s organization. This paper presents a new taxonomy of configuration methods based on the agents’ social interaction, a brief critique of each method, and finally suggests an adaptive configuration strategy. The proposed strategy uses a combination of these methods by selecting the right interaction method that is suitable for each market situation.
Dynamic features of flexible spacecraft control in process of its transformation into a large space structure
Authors: I. N. Krutova, V. M. Sukhanov
Venue: Automation and Remote Control (2008)

Consideration was given to dynamics of angular motion control of the flexible spacecraft reconstructed into a large space structure. In formal terms, this transformation lies in gradual reduction of the constructive rigidity to small values giving rise to low-frequency ( $$ \tilde f $$ ¿ 0.05 Hz) oscillations which represent one of the attributes of the class of large space structures. The existing quantitative definition of the large space structure was specified. It was demonstrated that as the frequencies of structure's elastic oscillations approach those of the control of object "rigid" motion, a new kind of interrelations between the motions of both types, the so-called "capture" of the controller frequency by that of the elastic oscillations, arises which impairs control efficiency to the point of losing system stability. Analytical (for the linear control systems) and computer-aided (for the discrete systems) methods for determination of the boundaries separating the two qualitatively different forms of existence of the transformed elastic object were proposed. Some results of computer simulation of the orientation control of variable objects such as flexible spacecraft and large space structure were presented.
On the computation of the topology of a non-reduced implicit space curve
Authors: Diatta Niang Daouda, Bernard Mourrain, Olivier Ruatta
Venue: Proceedings of the twenty-first international symposium on Symbolic and algebraic computation (2008)

An algorithm is presented for the computation of the topology of a non-reduced space curve defined as the intersection of two implicit algebraic surfaces. It computes a Piecewise Linear Structure (PLS) isotopic to the original space curve. The algorithm is designed to provide the exact result for all inputs. It's a symbolic-numeric algorithm based on subresultant computation. Simple algebraic criteria are given to certify the output of the algorithm. The algorithm uses only one projection of the non-reduced space curve augmented with adjacency information around some "particular points" of the space curve. The algorithm is implemented with the Mathemagix Computer Algebra System (CAS) using the SYNAPS library as a backend.
A Lattice-Based Semantic Location Model for Indoor Navigation
Authors: Dandan Li, Dik Lun Lee
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

Location models play an important role in location-based services (LBSs), because LBSs require a well-defined representation of location knowledge to support location browsing, navigation and query processing. Current location models can be divided into two categories: symbolic and geometric. Symbolic models try to represent the semantic relationships between entities, and geometric models are based on geometric coordinates and Euclidean distance.In this paper, we propose a lattice-based semantic location model (LSLM) for the indoor environment. LSLM is based on the exit-location model and the theory of “formal concept analysis.” The model can provide an explicit representation of the basic relationships between two entities such as containment and overlap. The nearest neighbor relationship on the concept lattice is used to define the optimal distance between two entities. Furthermore, the dual (location/exit) property of the model can cater for different navigation needs. We provide examples to show the effectiveness of our model.
Property Specification and Static Verification of UML Models
Authors: Igor Siveroni, Andrea Zisman, George Spanoudakis
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

We present a Static Verification Tool (SVT), a system that performs static verification on UML models composed of UML class and state machine diagrams. Additionally, the SVT allows the user to add extra behavior specification in the form of guards and effects by defining a small action language. UML models are checked against properties written in a special-purpose property language that allows the user to specify linear temporal logic formulas that explicitly reason about UML components. Thus, the SVT provides a strong foundation for the design of reliable systems and a step towards model-driven security.
Model checking based analysis of end-to-end latency in embedded, real-time systems with clock drifts
Authors: Swarup Mohalik, A. C. Rajeev, Manoj G. Dixit, S. Ramesh, P. Vijay Suman, Paritosh K. Pandya, Shengbing Jiang
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

End-to-end latency of messages is an important design parameter that needs to be within specified bounds for the correct functioning of distributed real-time control systems. In this paper we give a formal definition of end-to-end latency, and use this as the basis for checking whether a stipulated deadline is violated within a bounded time. For unbounded verification, we model the system as a set of communicating Timed Automata, and perform reachability analysis. The proposed method takes into account the drift of clocks which is shown to affect the latency appreciably. The method has been tested on a medium sized automotive example.