ppxscal/embedding_network huggingface dataset:
Bluetooth Worms: Models, Dynamics, and Defense Implications
Authors: Guanhua Yan, Stephan Eidenbenz
Venue: Proceedings of the 22nd Annual Computer Security Applications Conference (2006)

Recent occurrences of mobile worms like Cabir, Mabir and CommWarrior have created growing concerns over the security of data stored on mobile devices such as cell phones and PDAs. These worms have in common that they all use Bluetooth communication as their infection channel. In order to prepare effective defense strategies against such worms, we study the nature, characteristics, and spreading dynamics of Bluetooth worms in the safe environment of simulation. Our key findings are: (i) Mobility may not boost the Bluetooth worm propagation; instead, link instability owing to it has negative impact on the worm spreading speed; (ii) The inherent capacity constraints imposed by the wireless channel (e.g. interference) and the specifics of the Bluetooth protocol can significantly slow down the Bluetooth worm propagation; (iii) Intelligently designed worms can improve their propagation speed to a noticeable degree by strategically selecting worm model parameters or exploiting out-of-band propagation capabilities.
An adaptive algorithm of linear computational complexity for both rank and subspace tracking
Authors: Bin Yang, F. Gersemsky
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

Rank and subspace estimation is important in a variety of modern signal processing applications. In this paper we present a new approach for tracking both the rank and the signal subspace recursively. At arrival of each new sample, we update the eigenvectors spanning the signal subspace plus one or a fixed number of auxiliary eigenvectors, their corresponding eigenvalues, and an averaged noise eigenvalue. Then we apply information theoretic criteria to estimate the number of signals. The resulting adaptive algorithm has a computational complexity which is linearly proportional to the sample vector size n. In comparison to the URV based subspace tracking requiring O(n/sup 2/) operations, our approach is computationally simpler, easier to implement, and does not need user supplied tolerances. Simulation results show similar tracking performance of our algorithm to the URV updating and the exact eigenvalue decomposition.
Non-asymptotic statistical behaviours of 'ML' methods for bearing estimation
Authors: P. Larzabal, H. Clergeot
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The authors analyze the Cramer Rao bound and the statistical performance of some methods of direction-of-arrival (DOA) estimation, which can be derived from the maximum likelihood method (MLM). They use only ensemble average on time for all definitions concerning the second-order properties of the amplitudes. The result is that the further derivations are valid in the small sample case, even for one snapshot. Statistical behaviour of ML-based methods is established conditionally to a particular realization of the signal emitted. For this, a theoretical variance is derived of ML-based methods which allows an easy study of parameter influence on performance.
Computer security for minis and micros
Authors: Anne-Marie G. Claybrook
Venue: ACM SIGSMALL Newsletter (1983)

Mini and micro computers were originally designed mainly for low cost, real time computer applications. Security in these dedicated systems was not a concern. Now that minis and micros are being used in multi-user environments, security is much more a concern. In the commercial arena, security for word processing applications urgently needs to be addressed. Security and integrity are concerns in the communications area where minis and micros are used for both front-ends and network switches. Finally, with the widespread use of small computers in defense applications, data security in terms of the Department of Defense (DoD) national security policy also needs to be addressed.This paper provides some background on computer security to those new to the area and gives a general context for the two architecture papers following this overview.
Software: hard data
Authors: Phillip G. Armour
Venue: Communications of the ACM (2006)

Seeking solid information on the behavior of modern projects.
Spin structure of Cr with insertion of non-magnetic monatomic layers
Authors: V. N. Men'shov, V. V. Tugushev
Venue: Microelectronic Engineering (2005)

The magnetic structures of Cr/X nanomultilayer systems with non-magnetic monolayer X are studied in the framework of the Ginzburg-Landau functional approach. A mechanism for spin-density wave ordering induced by the impurity plane defect X has been proposed. The spatial distribution of the antiferromagnetic order parameter within the superlattice [Cr/X] is described for various temperatures, different kinds of inserted monolayers X, and thickness of Cr layer. The results obtained are compared with recently reported data from Mossbauer spectroscopy measurements on epitaxial X/Cr/Sn/Cr multilayers (X=V, Ag, or Fe).
Small- and large-signal modelling of a modular boost-derived DC-DC converter for high-output voltage applications
Authors: M. R. D. Al-Mothafar
Venue: International Journal of Modelling and Simulation (2006)

A procedure is established for the small- and large-signal modelling of modular current-mode controlled (CMC) pulse-width modulated (PWM) boost-derived transformer-isolated DC-DC converters. A three-module converter employing full-bridge topology is taken as an example. The converter is intended for high-output voltage applications and works in the continuous-current conduction mode. It consists of DC-DC modules whose inputs are connected in parallel and outputs in series across a common resistive load. Cycle-by-cycle simulations using PSpice are performed to aid the analysis.
Utilization of Maximum Data Hiding Capacity in Object-Based Text Document Authentication
Authors: Imtiaz Awan, S. A. M. Gilani, S. A. Shah
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Although data hiding in text document images is difficult due to the binary nature and clear separation between the background and foreground but it is getting higher demand for many applications. In this paper, a new enhanced embedding method is proposed for object-based text document authentication, in which the maximum data hiding capacity of the document is utilized for watermark embedding. Due to which maximum information that a document can contain is embedded within the entire document. Experimental results show that the proposed method utilizes the maximum data hiding capacity as watermark size to ensure the authenticity and integrity of the document much better as compared with the compared technique in which embedding and temper detection fails in some cases.
CAPSULE: Hardware-Assisted Parallel Execution of Component-Based Programs
Authors: Pierre Palatin, Yves Lhuillier, Olivier Temam
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

Since processor performance scalability will now mostly be achieved through thread-level parallelism, there is a strong incen- tive to parallelize a broad range of applications, including those with complex control flow and data structures. And writing par- allel programs is a notoriously difficult task. Beyond processor performance, the architect can help by facilitating the task of the programmer, especially by simplifying the model exposed to the programmer. In this article, among the many issues associated with writing par- allel programs, we focus on finding the appropriate parallelism granularity, and efficiently mapping tasks with complex control and data flow to threads. We propose to relieve the user and com- piler of both tasks by delegating the parallelization decision to the architecture at run-time, through a combination of hardware and software support and a tight dialogue between both. For the software support, we leverage an increasingly popular approach in software engineering, called component-based pro- gramming; the component contract assumes tight encapsulation of code and data for easy manipulation. Previous research works have shown that it is possible to augment components with the ability to split/spawn, providing a simple and fitting approach for programming parallel applications with complex control and data structures. However, such environments still require the program- mer to determine the appropriate granularity of parallelism, and spawning incurs significant overheads due to software run-time system management. For that purpose, we provide an environment with the ability to spawn conditionally depending on available hardware resources, and we delegate spawning decisions and actions to the architec- ture. This conditional spawning is implemented through frequent hardware resource probing by the program. This, in turn, enables rapid adaptation to varying workload conditions, data sets and hardware resources. Furthermore, thanks to appropriate com- bined hardware and compiler support, the probing has no signifi- cant overhead on program performance. We demonstrate this approach on an 8-context SMT, sev- eral non-trivial algorithms and re-engineered SPEC CINT2000 benchmarks, written using component syntax processed by our toolchain. We achieve speedups ranging from 1.1 to 3.0 on our test suite.
Quantum computation of zeta functions of curves
Authors: Kiran S. Kedlaya
Venue: Computational Complexity (2006)

We exhibit a quantum algorithm for determining the zeta function of a genus g curve over a finite field Fq, which is polynomial in g and log(q) This amounts to giving an algorithm to produce provably random elements of the class group of a curve, plus a recipe for recovering a Well polynomial from enough of its cyclic resultants. The latter effectivizes a result of Fried in a restricted setting.
Managing Quality of Context in Pervasive Computing
Authors: Yingyi Bu, Tao Gu, Xianping Tao, Jun Li, Shaxun Chen, Jian Lu
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

Context-awareness plays a key role in a paradigm shift from traditional desktop styled computing to emerging pervasive computing. Many context-aware systems have been built to achieve the vision of pervasive computing and alleviate the human attention bottleneck; however, these systems are far from real world applications. Quality of context is critical in reducing the gap between existing systems and real-life applications. Aiming to provide the support of quality of context, in this paper, we propose a novel quality model for context information and a context management mechanism for inconsistency resolution. We also build a prototype system to validate our proposed model and mechanism, and to assist the development of contextaware applications. Through our evaluations and case study, context-aware applications can be built with the support of quality of context.
Diagnosability Test for Timed Discrete-Event Systems
Authors: J. Pan, S. Hashtrudi-Zad
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

In this paper, an algorithm with polynomial timecomplexity is presented for testing failure diagnosability in (untimed) discrete-event systems in a state-based framework. Furthermore, an algorithm for testing failure diagnosability in timed discrete-event systems is provided. The test for timed discrete-event systems, in particular, first gathers and complies the information about the timing of events (represented in the timed transition graph of the timed system) in the transition-time function of a reduced model, and then uses this model to verify diagnosability. Sufficient conditions are obtained under which the transition-time sets can be represented as the union of a bounded number of intervals, and the test will have polynomial complexity. This new test, as shown using examples, may significantly reduce the computations of testing diagnosability, compared with other polynomial diagnosability tests (for untimed systems) adapted for timed systems.
Deficits for Semantics and the Irregular Past Tense: A Causal Relationship?
Authors: Lorraine K. Tyler, Emmanuel A. Stamatakis, Roy W. Jones, Peter Bright, Kadia Acres, William D. Marslen-wilson
Venue: Journal of Cognitive Neuroscience (2004)

The regular and irregular past tense has become a focus for recent debates about the structure of the language processing system, asking whether language functions are subserved by different neural and functional mechanisms or whether all processes can be accommodated within a single unified system. A critical claim of leading single mechanism accounts is that the relationship between an irregular stem and its past tense form is primarily semantic and not morphological in nature. This predicts an obligatory relationship between semantic performance and access to the irregular past tense, such that a semantic deficit necessarily leads to impairments on the irregulars. We tested this claim in a series of studies probing the comprehension and production of regular and irregular past tense forms in four semantic dementia patients, all of whom had profound semantic deficits. In two elicitation tasks and one auditory priming study, we found that three out of the four patients did not have a deficit for the irregular past tense, in spite of their semantic deficits. This argues against the view that the relationship between irregular past tense forms and their stems is primarily semantic, and more generally against the single system claim that morphological structure can be captured solely based on phonological and semantic relationships.
Fast and Adaptive Pairwise Similarities for Graph Cuts-based Image Segmentation
Authors: Baris Sumengen, Luca Bertelli, B. S. Manjunath
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

We introduce the use of geodesic distances and geodesic radius for calculating pairwise similarities needed in various graph cuts based methods. By using geodesics on an edge strength function we are able to calculate similarities between pixels in a more natural way. Our technique improves the speed and reliability of calculating similarities and leads to reasonably good image segmentation results. Our algorithm takes an edge strength function as its input and its speed is independent of the feature dimension or the distance measure used.
A performance model of highly available multicomputer systems
Authors: S. Misbahuddin, N. Al-Holou, S. T. Khan
Venue: International Journal of Modelling and Simulation (2006)

Multicomputers are distributed memory systems in which independent computers are connected with each other by a network. Multicomputers are widely used in business and scientific applications. Due to their flexibility, scalability, and cost performance, multicomputer systems are considered preferable to multiprocessor systems. They are also gaining attraction in the area of Internet-based computing, in which delays or interruptions in client-server interactions may be equally costly to service providers and customers. Multicomputer systems attributed with high available (HA) solutions may be used to withstand service unavailability due to the web servers' failures. In this paper we investigate a Markov model-based approach to estimate the availability of multicomputer systems with and without HA. The availability is computed as a function of server failure rate and the number of surviving servers. This model can estimate the number of nodes needed for a required availability measure.
Design and Implementation of Intelligent Vehicle Monitoring and Management System Based on the Multi-Net
Authors: Kaihua Xu, Ya Wang, Wei Teng, Yuhua Liu
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

In this paper, an intelligent vehicle monitoring and management system (IVMMS) based on the multi-net is designed. First, its architecture and functions are introduced. It uses many technologies fusing GPS, GPRS/CDMA, GIS, RS and Internet, and is composed mainly by two major parts: the Mobile Terminal and the Monitoring Center. Especially, GPRS/CDMA technology is the reliable technical support for wireless communication smooth transition from the 2.5G to the 3G; then, the principles and the key technologies of Mobile Terminal and Monitoring Center are discussed respectively in detail, and figures of their structures are also shown below; finally, a novel vehicle scheduling model based on ant algorithms are proposed and the course of scheduling tasks is also introduced. It is indicated that, the vehicles scheduling efficiency is enhanced greatly. The system not only can be used in the vehicles scheduling, but also in the vessel and other fields, and the solid technical support will be provided for the ITS research.
Software Process Definition & Improvement: An Industry Report
Authors: Michael Jester, Herb Krasner, Dewayne E. Perry
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

We present highlights of an process improvement project at a software center in preparation for CMM Level 3, with applicable examples given that relate to CMM level 2, level 3, and the effort needed in transitioning between level 2 and 3. For the efforts taken at this particular software center, the work documented is divided into three parts: the level 2 bases for moving to level 3, the process definition and the process database. Finally, some qualitative and quantitative analysis, suggestions for future work, and conclusions regarding overall lessons learned from the experience are provided.
Image Completion Using Global Optimization
Authors: Nikos Komodakis
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

A new exemplar-based framework unifying image completion, texture synthesis and image inpainting is presented in this work. Contrary to existing greedy techniques, these tasks are posed in the form of a discrete global optimization problem with a well defined objective function. For solving this problem a novel optimization scheme, called Priority- BP, is proposed which carries two very important extensions over standard belief propagation (BP): "prioritybased message scheduling" and "dynamic label pruning". These two extensions work in cooperation to deal with the intolerable computational cost of BP caused by the huge number of existing labels. Moreover, both extensions are generic and can therefore be applied to any MRF energy function as well. The effectiveness of our method is demonstrated on a wide variety of image completion examples.
Neural Wireless Sensor Networks
Authors: Frank Oldewurtel, Petri Mahonen
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

We present an overview of embedded network applications and discuss requirements arising from this analysis. Furthermore, we discuss selected in-network processing techniques and point out the analogy between neural and sensor networks. In the following neural networks are introduced in the sensor network context. We describe the motivation and the practical case for neural networks in the sensor networks context, and evaluate early results achieved with our test implementation. We argue that there is a high potential with these paradigms which promise a strong impact on the future research, especially if applied as a hybrid technology.
Spherical harmonic transforms for discrete multiresolution applications
Authors: J. A. Blais, D. A. Provins, M. A. Soofi
Venue: The Journal of Supercomputing (2006)

On the sphere, global Fourier transforms are non Abelian and usually called Spherical Harmonic Transforms (SHTs). Discrete SHTs are defined for various grids of data but most applications have requirements in terms of preferred grids and polar considerations. Chebychev quadrature has proven most appropriate in discrete analysis and synthesis to very high degrees and orders. Multiresolution analysis and synthesis that involve convolutions, dilations and decimations are efficiently carried out using SHTs. The high-resolution global datasets becoming available from satellite systems require very high degree and order SHTs for proper representation of the fields. The implied computational efforts in terms of efficiency and reliability are very challenging. The efforts made to compute SHTs and their inverses to degrees and orders 3600 and higher are discussed with special emphasis on numerical stability and information preservation. Parallel and grid computations are imperative for a number of geodetic, geophysical and related applications where near kilometre resolution is required. Parallel computations have been investigated and preliminary results confirm the expectations in terms of efficiency. Further work is continuing on optimizing the computations.
UFS: a global trade-off strategy for loop unrolling for VLIW architectures: Research Articles
Authors: K. Heydemann, F. Bodin, P. M. W. Knijnenburg, L. Morin
Venue: Concurrency and Computation: Practice Experience (2006)

Embedded systems are increasingly expected to provide good performance at low cost. As the characteristics of compiled code can have an impact on the overall cost of an embedded system, a compilation strategy must be cost aware as well as achieve high performance. As one major factor for system cost is memory size, code size becomes an important issue in code generation. Thus, cost-effective optimization strategies that are able to perform a good trade-off between code size and performance improvement are needed. In this paper, we propose a novel method based on Integer Linear Programming for computing efficient unroll factors for collections of loop nests with control over code size and side-effects of the transformation. We define a notion of trade-off between code size and performance. Experiments on the Philips Trimedia show that our method achieves excellent trade-offs. Copyright &copy; 2006 John Wiley & Sons, Ltd.
The Missing Link: A Case Study of Sensing-and-Modeling Toolkits for Constructionist Scientific Investigation
Authors: Paulo Blikstein, Uri Wilensky
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

Multi-agent modeling has been successfully used in several scientific fields, oftentimes transforming scientists' practice and mindsets. Educational researchers have also realized the potential of this modeling approach for learning. Studies have suggested that students are able to understand concepts above their expected grade level after interacting with curricula developed using multi-agent simulation. However, most multi-agent models are exclusively 'on-screen', without connection to the physical world. Real-time model validation and realworld sensing are very challenging to accomplish with extant modeling platforms. As an attempt to address this issue, we designed a technological platform to enable students to seamlessly connect multi-agent models and electronic sensors, in real time. The platform is designed for learners to validate, refine, and debug their computer models using real-world data. This paper focuses on the technical and pedagogical aspects of this project, describing pilot studies which suggest a real-to-virtual reciprocity that catalyzes further inquiry toward deeper understanding.