ppxscal/embedding_network huggingface dataset:
The Architecture of Host-based Intrusion Detection Model Generation System for the Frequency Per System Call
Authors: Seung-Hyun Paek, Yoon-Keun Oh, JooBeom Yun, Do-Hoon Lee
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

There have been a number of researches to apply data mining techniques to intrusion detection. However, most of researches have mainly focused on the intrusion detection system in network area and have been done shortly in host area by applying a certain data mining technique to host-based intrusion detection. In this paper, we propose the architecture of host-based intrusion detection model generation system which creates candidate models by various and popular existing data mining techniques and one new technique (sC4.5) for the process behavior data set with the frequency feature per system call and then elects the best appropriate model according to user requirements after evaluating candidate models. The frequency feature per system call is simpler than the existing system call sequence feature in applying to intrusion detection system as the model. We also propose sC4.5 as a decision tree classification algorithm by complimenting existing C4.5 algorithm. sC4.5 preserves classification accuracy like C4.5 and make the decision tree smaller than C4.5.
Excel Visualizer: One Click WYSIWYG Spreadsheet Visualization
Authors: Richard Brath, Michael Peters
Venue: Proceedings of the conference on Information Visualization (2006)

Oculus Excel Visualizer is a point and click data visualization framework which leverages the inherent data collection, organization and modeling capabilities of spreadsheets and creates easy to use, easy to comprehend 3D visualizations by re-using the layout and formatting already present in the spreadsheet.
Service and Resource Discovery Using P2P
Authors: Mika Pennanen, Sami Lehtonen, Sami Ponkanen
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

In the near future, the way of using the Internet is changing. The Internet and services are available for millions of small mobile terminal devices - with different kind of hardware e.g. processor, memory and bandwidth than current desktop computers. Additionally, different network technologies make things a bit more complicated particularly because of heterogeneous networks and devices. The heterogeneous networks, terminal devices, and their user interface raise new demands on services. Deploying an efficient service and resource discovery mechanism can solve many of these challenges.
Bayesian Estimation of Smooth Parameter Maps for Dynamic Contrast-Enhanced MR Images with Block-ICM
Authors: B. Michael Kelm, Natalie Mueller, Bjoern H. Menze, Fred A. Hamprecht
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

In cancer, pathological tissue often exhibits abnormal perfusion and vascular permeability. These can be estimated by monitoring the abundance of an injected contrast medium over time, using Dynamic Contrast-Enhanced (DCE) MR Imaging. The resulting spatially resolved time curves are usually interpreted in terms of a pharmacokinetic model which is fitted by maximum likelihood. However, the resulting nonlinear least squares (NLLS) problem may exhibit spurious local optima leading to false parameter estimates at individual voxels in the generated parameter map. We propose the application of a spatial prior model in form of a generalized Gaussian Markov random field. By using information from parameter estimates at neighboring voxels and computing a maximum a posteriori solution for the whole parameter map at once, false local optima at individual voxels can be avoided. Since the number of variables gets very big for common image resolutions, standard NLLS solvers cannot be employed anymore. We therefore propose a generalized iterated conditional modes (ICM) approach operating on blocks instead of sites. Results on DCE-MR images of the prostate show less speckle noise in the resulting parameter maps. Furthermore, the mean square error (MSE) in the affected voxels is significantly smaller, thus reflecting a better fit.
A System for Patient Management Based Discrete-Event Simulation and Hierarchical Clustering
Authors: Anthony Codrington-Virtue, Thierry Chaussalet, Peter Millard, Paul Whittlestone, John Kelly
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Hospital Accident and Emergency (A&E) departments in England have a 4 hour target to treat 98% of patients from arrival to discharge, admission or transfer. Managing resources to meet the target and deliver care across the range of A&E services is a huge challenge for A&E managers. This paper develops an intelligent patient management tool to help managers and clinicians better understand patient length of stay and resources within an A&E area. The developed discrete-event simulation model gives a highlevel representation of ambulance arrivals into A&E. The model facilitates analysis in the following ways: visually interactive software showing patient length of stay in the A&E area; patient activity broken down into sub-groups so that intelligence might be gathered on how sub-groups affect the overall length of stay; understanding the number of patient treatment places and nurse resources required. To support ease of inputs for scenario and sensitivity testing, data is entered into the simulation model (Simul8) via Excel spreadsheets. The model discussed in this paper used patient length of stay grouped by A&E diagnosis codes and was limited to ambulance arrivals. The analysis was derived from A&E attendance in 2004 from an English hospital.
Characterization of a Real Internet Radio Service
Authors: David Melendi, Manuel Vilas, Roberto Garcia, Xabiel G. Paneda, Victor Garcia
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

The increase in the number of web-pages where links to Internet-radios are offered has made these services one of the most popular in nowadays Internet. This popularity has motivated the interest of the scientific community and a lot of research has been carried out in order to improve and study these services. This paper presents the analysis of the Internet-radio hosted by the www.asturies.com digital newspaper. The study has been performed thanks to a log database stored over a period of almost two years. The traffic between every service device has been studied and different elements about users' behaviour have been analyzed. The conclusions are essential to improve the configuration of one of these services. Service models for Internet-radio services can be developed and help managers to test different configurations or predict future situations, avoiding problems in advance.
On AR representations for cyclostationary processes
Authors: P. J. Sherman, L. B. White, R. R. Bitmead
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The authors consider autoregressive (AR) types of wide sense cyclostationary (WSC) processes. The comparative performance of the discrete Fourier transform (DFT) autoregressive (AR) methods of estimating the time-periodic spectral density of an AR(2) WSC process is provided. Problems with these methods are addressed in the case of uncertainty of the process period. Examples concerning an AR(2) process subjected to period drift and randomness are provided to show that the time-varying spectral estimate converges to a time-invariant one. Results from stochastic differential equations which support this behaviour are cited. Finally, the method of extended Kalman filtering is proposed to track a slowly time-varying period.
In Search of an Adequate Yet Affordable Tutor in Online Learning Networks
Authors: Peter B. Sloep, Peter van Rosmalen, Liesbeth Kester, Francis Brouns, Rob Koper
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Learning in a learning network tends to be taxing for tutors, mainly because of the heterogeneity of the student group. Moreover, online learners tend be 'lone' learners with little or no social contacts in the network. Traditionally, intelligent tutoring systems have been used to provide content related support to individual students. It is argued that these are not a sensible solution for learning networks as they are costly to set up and run, and do not solve the social isolation issue. An alternative solution, peer tutoring in ad hoc communities, is discussed. Although perhaps equally costly to develop, its running costs should be lower. Moreover, an ad hoc community is a first step towards better socially connections. And finally, peer tutoring is not a mere community chore, but a rewarding educational experience.
Adopting Default Reasoning in Service Composition Context
Authors: Zheng Lu, Aditya Ghose, Peter Hyland
Venue: Proceedings of the European Conference on Web Services (2006)

Web Service composition is the ability of one business to provide value-added services to its customers through the composition of basic Web services, possibly offered by different companies [12]. Because of distributed responsibilities, ownership and control, it is often not feasible to acquire all information needed for service composition. These characteristics are fundamental to service oriented computing but make it inherently difficult to avoid service conflicts. To reason about and adapt to a changing environment, in this work, we will extend current OWL-S by introducing the concept of service assumptions which allow reasoning with incomplete information. Furthermore, together with the proposed service assumptions, a sequence of rules is proposed to describe all permitted behaviors in service composition context.
Advanced Unbounded Model Checking Based on AIGs, BDD Sweeping, And Quantifier Scheduling
Authors: Florian Pigorsch, Christoph Scholl, Stefan Disch
Venue: Proceedings of the Formal Methods in Computer Aided Design (2006)

In this paper we present a complete method for verifying properties expressed in the temporal logic CTL. In contrast to the majority of verification methods presented in recent years, we support unbounded model checking based on symbolic representations of characteristic functions. Among others, our method is based on an advanced And-Inverter Graph (AIG) implementation, quantifier scheduling, and BDD sweeping. For several examples, our method outperforms BDD based symbolic model checking by orders of magnitude. However, our approach is also able to produce competitive results for cases where BDD are known to perform well.
Modeling energy constrained routing in selfish ad hoc networks
Authors: Petteri Nurmi
Venue: Proceeding from the 2006 workshop on Game theory for communications and networks (2006)

In static networks, game theory has long been used to model the routing decisions of network nodes. However, once we move to dynamic and resource constrained settings, such as ad hoc or sensor networks, traditional models are no longer sufficient. Instead, new models that capture the dynamic nature of the decisions and the resource constraints of the devices are needed. To date, several models that attempt to capture the dynamic nature of routing decisions have been proposed. However, the resource constraints of the devices and the uncertainty about the resources of other devices have been thus far ignored. To this end, we present a game theoretic model that formalizes the resources of the nodes and the beliefs the nodes have about the resources of other nodes. We also discuss the structure of strategies in the proposed model and make explicit the role the resources and beliefs of the nodes play in routing decisions. In addition to presenting a game theoretic model, we propose a method that allows the nodes to learn equilibrium strategies over time, and prove that the strategies suggested by the mechanism converge to a sequential equilibrium. Finally, we present simulations that give insights into the expected behavior of the devices under the proposed model.
Capacity analysis of automated material handling systems in semiconductor fabs
Authors: Michael E. Kuhl, Julie Christopher
Venue: Proceedings of the 36th conference on Winter simulation (2004)

A critical aspect of semiconductor manufacturing is the design and analysis of material handling and production control polices to optimize fab performance. As wafer sizes have increased, semiconductor fabs have moved toward the use of automated material handling systems (AMHS). However, the behavior of AMHS and the effects of AMHS on fab productivity is not well understood. This research involves the development of a design and analysis methodology for evaluating the throughput capacity of AMHS. A set of simulation experiments is used to evaluate the throughput capacity of an AMHS and the effects on fab performance measures. The analysis uses SEMATECH fab data for full semiconductor fabs to evaluate the AMHS throughput capacity.
An Untraceable Electronic Cash System Using Fair Blind Signatures
Authors: Hui-Feng Huang, Chin-Chen Chang
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Since the blind signature scheme has the unlinkability property, it can be used for untraceable electronic cash systems. The unlinkability property protects the privacy of users; however, it may be abused by criminals, e.g., to launder money or to safely get a ransom. The techniques of fair blind signature are developed to withstand the misuse of unlinkability property. In this paper, we propose not only a user-efficient but also a signer-efficient fair blind signature scheme for untraceable electronic cash. Only with the help from a judge or government, the signer or the banker can derive the link between a signature and the instance of the signing protocol which produces the signature when the unlinkability property is abused. Comparing with existing fair blind signature schemes, our method greatly reduces the computational load of an on-line judge. Hence, the proposed method with an efficient judge can let the signer provide more efficient services to the signature requesters. It is also suitable for the limited computation capacities of users such as smart cards or mobile units. So, the proposed scheme is very useful for e-commerce transactions.
Terahertz radiation from narrow-gap semiconductors photoexcited by femtosecond laser pulses
Authors: R. Adomavičius, A. Urbanowicz, G. Molis, A. Krotkus
Venue: Microelectronic Engineering (2005)

Large increase of the emitted terahertz power has been observed for p-InAs samples with the p-doping levels of ~10^1^6-10^1^7cm^-^3. This increase was explained by a large surface depletion layer and an electric-field-induced optical rectification effect in the layer. Terahertz fields radiated by the samples of all three investigated Cd"xHg"1"-"xTe layers was of the same order of magnitude. No azimuthal angle dependence of the radiated signal was detected, what evidences that linear current surge effect is dominating over nonlinear optical rectification. Azimuthal angle and magnetic fields emission witness that it is caused by linear photo-Dember type processes.
Default-Mode Activity during a Passive Sensory Task: Uncoupled from Deactivation but Impacting Activation
Authors: Michael D. Greicius, Vinod Menon
Venue: Journal of Cognitive Neuroscience (2004)

Deactivation refers to increased neural activity during lowdemand tasks or rest compared with high-demand tasks. Several groups have reported that a particular set of brain regions, including the posterior cingulate cortex and the medial prefrontal cortex, among others, is consistently deactivated. Taken together, these typically deactivated brain regions appear to constitute a default-mode network of brain activity that predominates in the absence of a demanding external task. Examining a passive, block-design sensory task with a standard deactivation analysis (rest epochs vs. stimulus epochs), we demonstrate that the default-mode network is undetectable in one run and only partially detectable in a second run. Using independent component analysis, however, we were able to detect the full default-mode network in both runs and to demonstrate that, in the majority of subjects, it persisted across both rest and stimulus epochs, uncoupled from the task waveform, and so mostly undetectable as deactivation. We also replicate an earlier finding that the default-mode network includes the hippocampus suggesting that episodic memory is incorporated in default-mode cognitive processing. Furthermore, we show that the more a subject's default-mode activity was correlated with the rest epochs (and "deactivated" during stimulus epochs), the greater that subject's activation to the visual and auditory stimuli. We conclude that activity in the default-mode network may persist through both experimental and rest epochs if the experiment is not sufficiently challenging. Time-series analysis of default-mode activity provides a measure of the degree to which a task engages a subject and whether it is sufficient to interrupt the processes&mdash;presumably cognitive, internally generated, and involving episodic memory&mdash;mediated by the default-mode network
Multiplicative Schwarz algorithms for the p-version Galerkin boundary element method in 3D
Authors: Matthias Maischak
Venue: Applied Numerical Mathematics (2006)

We study a 2-level multiplicative Schwarz method for the p version Galerkin boundary element method for a weakly singular integral equation of the first kind in 3D. We prove that the rate of convergence of the multiplicative Schwarz operator for the p version grows only logarithmically in p and is independent of h.
Secure two-party computational geometry
Authors: Shun-Dong Li, Yi-Qi Dai
Venue: Journal of Computer Science and Technology (2005)

Secure Multi-party Computation has been a research focus in international cryptographic community in recent years. In this paper the authors investigate how some computational geometric problems could be solved in a cooperative environment, where two parties need to solve a geometric problem based on their joint data, but neither wants to disclose its private data to the other party. These problems are the distance between two private points, the relation between a private point and a circle area, the relation between a private point and an ellipse area and the shortest distance between two point sets. The paper gives solutions to these specific geometric problems, and in doing so a building block is developed, the protocol for the distance between two private points, that is also useful in the solutions to other geometric problems and combinatorial problems.
Linearly Ordered Plugins through Self-Organization
Authors: Boto Bako, Andreas Borchert, Norbert Heidenbluth, Johannes Mayer
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

Nowadays, plugin-based applications are quite common. Eclipse is probably the most popular example of such an application. By means of plugins, end-users can add or remove functionality even at runtime. Besides the kernel, plugin-based applications can be kept very small and nearly everything can be designed as a plugin. However, if plugins are added at runtime, their ordering is difficult to organize. This can be observed for graphical user interface representations of plugins, such as menu or list items for example. In particular, the kernel may not refer to a single concrete plugin, since it has to be independent of concrete plugins-according to the plugin concept. Therefore, self-organization is proposed in the present paper as a solution to structure plugin-based applications. A pattern for linearly ordered plugins is presented. The end-user still retains the possibility to reorder the plugins manually according to his preferences. A sample application of the presented pattern in the context of graphical user interfaces is described.
A Fast Facial Expression Recognition Method at Low-Resolution Images
Authors: Cheng-Chang Lien, Yang-Kai Chang, Chih-Chiang Tien
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

In this paper, we propose a novel image-based facial expression recognition method called "expression transition" to identify six kinds of facial expressions (anger, fear, happiness, neutral, sadness, and surprise) at low-resolution images. Two approaches: direct mapping and singular value decomposition (SVD) are applied to calculate the expression transition matrices. The transformed images with a set of expression transition matrices are compared to identify the facial expressions. The experimental results show that the proposed facial expression recognition system can recognize 120 test images in the Chon-Kanade facial expression database with high accuracy and efficiency.
Prefrontal Cortex Activity Associated with Source Monitoring in a Working Memory Task
Authors: Karen J. Mitchell
Venue: Journal of Cognitive Neuroscience (2004)

Using functional magnetic resonance imaging (fMRI), we investigated prefrontal cortex (PFC) activity during remembering specific source information (format, location judgments) versus remembering that could be based on undifferentiated information, such as familiarity (old/new recognition [ON], recency judgments). A working memory (WM) paradigm with an immediate test yielded greater activation in the lateral PFC for format and location source memory (SM) tasks than ON recognition; this SM-related activity was left lateralized. The same regions of PFC were recruited in Experiment 2 when information was tested immediately and after a filled delay. Substituting recency for location judgments (Experiment 3) resulted in an overall shift in task context that produced greater right PFC activity associated with ON and recency tasks compared to the format task, in addition to left SM-related activity. These data extend to WM previous findings from long-term memory (LTM) indicating that the left and right PFC may be differentially involved in memory attributions depending on the specificity of information evaluated. The findings also provide evidence for the continuity of evaluative processes recruited in WM and LTM.