ppxscal/embedding_network huggingface dataset:
Remote Web Server of Digital Signal Processors Cards and its Applications in Education
Authors: Francisco Ibarra Pico, Andres Fuster Guillo, Jose Colom Lopez
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

A system is presented for the remote execution and planning of processes on digital signal processor cards. The hardware and software designed permits the sharing of processors and remote execution on the part of the users. We can distinguish three major modules: the Host, which acts as a signal processor hardware server, the customers, who send processes (typically programs written in C) and receive the compilation and results of the execution, and lastly, the host/customer connection (the link is carried out on a logic level, and thus independently of the type of net connection: internet, ethernet, token...).This situation is adequate for permitting access to high cost hardware platforms on the part of multiple users, facilitating the sharing of resources in research groups and the utilization in the classroom (at accessible costs) of high technology (where, until now, only the use of low cost processors has been envisaged).
Ontological approach to the specification of properties of software systems and their components
Authors: L. P. Babenko
Venue: Cybernetics and Systems Analysis (2009)

A new approach to the organization of life cycles of software systems is proposed that is oriented toward maximally applying reusable assets at all stages of development of new software products. This approach is based on an original mechanism of sharing problem domain ontologies and ontologies pertinent to software engineering processes and reusable solution types.
Study on an Improved Extended-RBAC Model
Authors: Xuewang Zhang, Yulin Zhang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

This paper expounds the shortages of RBAC96 model in the aspects of the authorization, access rules, and fine-grained access control in the practical application; and analyses the shortcomings of the extended role-based access control model (E-RBAC), which integrates the authorization of users and roles, one new expansion model was presented and achieved. The new model not only can achieve fine-grained access control, but also make higher security by introducing of access rules and audit function.
Software system scalability: concepts and techniques
Authors: David S. Rosenblum
Venue: Proceedings of the 2nd India software engineering conference (2009)

With physical limits approaching in hardware, with demands on large-scale software systems continually increasing, and with the use of resource-poor wireless devices rapidly growing, issues of scale are becoming paramount in software engineering. Indeed, it is increasingly the case that software systems undergo a successful initial development, only to be found unfit for purpose in deployment, sometimes years after the initial development was completed. This happens because the systems are frequently designed without a precise understanding of, and accounting for, the evolving characteristics of the environment in which they will be deployed. This lack of understanding leads to problems of scalability and the need for radical re-design of the software to make it more scalable. The technical literature is full of references to the term scalability but devoid of precise definitions and clear understandings of the term. Furthermore, software developers lack the means to construct suitable objective characterizations of system scalability and to analyze and compare the scalability of different designs. In this talk I discuss the nature of scalability and the conflicting views that researchers and practitioners have of scalability, using several examples to illustrate the problem. I then present a precise definition of the term and a simple analysis technique that can be used to characterize, evaluate and compare the scalability of software systems. I conclude with a discussion of techniques for eliciting the scalability requirements of a software system, which are needed in order to instantiate the definition and analysis technique for a particular system design or set of candidate designs. I illustrate these ideas with a real-world example of a financial fraud detection system that already has undergone two complete re-designs due to scalability problems.
The effect of materials testing modes on finite element simulation of hard machining via the use of internal state variable plasticity model coupled with experimental study
Authors: S. Anurag, Y. B. Guo, M. F. Horstemeyer
Venue: Computers and Structures (2009)

To understand the true nature of hard turning mechanics, a numerical model that incorporates an internal state variable plasticity model via a material user subroutine has been developed with the material constants obtained from the compression and tension tests. A global material failure/damage evolution model was implemented to simulate chip formation that solely depends on the material deformation state. Orthogonal hard turning experiments were performed to validate the numerical model. The purpose of this work was to determine the material property differences under the different stress states by using numerical simulations. The numerical and experimental results illustrated that the material constants from the compression tests captured the true nature of a hard machining process as compression dominates the of material deformation process in hard machining.
Interoperability testing for e-government web services
Authors: Giorgos Pentafronimos, Spyridon Papastergiou, Nineta Polemi
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

The provision of Web Service-based services in many areas of the digital world such as the e-Government still involves addressing interoperability of these services. Several testing methodologies that evaluate the interoperability of the services indicate the need for a machine-readable representation of the test cases allowing the automation of the test process. Existing languages for representing test cases demonstrate specific weaknesses. This paper identifies these weaknesses and proposes a sequence of steps for the definition of test cases and a XML representation of them based on the XML Requirement and Test language (XRT).
Network Topology Inference Based on Traceroute and Tomography
Authors: Liao Hailiang, Hu Guangmin, Qian Feng, Yang Zhihao
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

Network topology inference with "sandwich" probes is a new technology of network tomography. In traditional methods of network topology inference using traceroute, anonymous routers seriously affect the performance of topology inference. The methods of network topology inference based on tomography are mostly computational complexity and inaccurate. This paper introduces a network topology inference method combine the advantage of both traceroute and tomography. This method constructs an initialized topology using the traceroute result and then obtains a final topology using "Topology Updating Algorithm" with the "sandwich" probes. The simulation on NS2 shows that this method can not only solve the problem of anonymous router but also reduce the computational complexity, and improve the veracity as well.
Orchestra: intrusion detection using parallel execution and monitoring of program variants in user-space
Authors: Babak Salamat, Todd Jackson, Andreas Gal, Michael Franz
Venue: Proceedings of the 4th ACM European conference on Computer systems (2009)

In a Multi-Variant Execution Environment (MVEE), several slightly different versions of the same program are executed in lockstep. While this is done, a monitor compares the behavior of the versions at certain synchronization points with the aim of detecting discrepancies which may indicate attacks. As we show, the monitor can be implemented entirely in user space, eliminating the need for kernel modifications. As a result, the monitor is not a part of the trusted code base. We have built a fully functioning MVEE, named Orchestra, and evaluated its effectiveness. We obtained benchmark results on a quad-core system, using two variants which grow the stack in opposite directions. The results show that the overall penalty of simultaneous execution and monitoring of two variants on a multi-core system averages about 15% relative to unprotected conventional execution
SubSpace Projection: A unified framework for a class of partition-based dimension reduction techniques
Authors: Hao Cheng, Khanh Vu, Kien A. Hua
Venue: Information Sciences: an International Journal (2009)

Similarity search in high dimensional space is a nontrivial problem due to the so-called curse of dimensionality. Recent techniques such as Piecewise Aggregate Approximation (PAA), Segmented Means (SMEAN) and Mean-Standard deviation (MS) prove to be very effective in reducing data dimensionality by partitioning dimensions into subsets and extracting aggregate values from each dimension subset. These partition-based techniques have many advantages including very efficient multi-phased approximation while being simple to implement. They, however, are not adaptive to the different characteristics of data in diverse applications. We propose SubSpace Projection (SSP) as a unified framework for these partition-based techniques. SSP projects data onto subspaces and computes a fixed number of salient features with respect to a reference vector. A study of the relationships between query selectivity and the corresponding space partitioning schemes uncovers indicators that can be used to predict the performance of the partitioning configuration. Accordingly, we design a greedy algorithm to efficiently determine a good partitioning of the data dimensions. The results of our extensive experiments indicate that the proposed method consistently outperforms state-of-the-art techniques.
The cost of computer privacy
Authors: Jerome Lobel
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

A little over one year ago, Honeywell Information Systems accepted an invitation to sponsor an important research project at Harvard University dealing with the subject of computer privacy. This work which was completed recently was performed by Dr. Robert C. Goldstein as partial fulfillment of his Doctoral Degree at Harvard. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
SubPolyhedra: A (More) Scalable Approach to Infer Linear Inequalities
Authors: Vincent Laviron, Francesco Logozzo
Venue: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (2008)

We introduce Subpolyhedra (SubPoly) a new numerical abstract domain to infer and propagate linear inequalities. Subpoly is as expressive as Polyhedra, but it drops some of the deductive power to achieve scalability. Subpoly is based on the insight that the reduced product of linear equalities and intervals produces powerful yet scalable analyses. Precision can be recovered using hints. Hints can be automatically generated or provided by the user in the form of annotations.We implemented Subpoly on the top of Clousot, a generic abstract interpreter for .Net. Clousot with Subpoly analyzes very large and complex code bases in few minutes. Subpoly can efficiently capture linear inequalities among hundreds of variables, a result well-beyond state-of-the-art implementations of Polyhedra.
A hybrid noise cancelling algorithm with secondary path estimation
Authors: Edgar Lopez-Caudana, Pablo Betancourt, Enrique Cruz, Mariko Nakano-Miyatake, Hector Perez-Meana
Venue: WSEAS Transactions on Signal Processing (2008)

This paper presents a hybrid active noise canceling (HANC) algorithm to overcome the acoustic feedback present in most ANC system, together with an efficient secondary path estimation scheme. The HANC system provides a solution of two fundamental problems present in these kind of ANC systems: The first consists in a reduction of the acoustic feedback from the cancellation loudspeaker to the input microphone, using two FIR adaptive filters, one with a feedforward configuration an the other with a feedback adaptive filter configuration. To overcome the secondary path modeling problem, a modification of the method proposed by Akhtar is used. Computer simulation results are provide to show the noise cancellation and secondary path estimation performance of presented scheme.
Simulating point processes by intensity projection
Authors: Kay Giesecke, Hossein Kakavand, Mohammad Mousavi
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Point processes with stochastic intensities are ubiquitous in many application areas, including finance, insurance, reliability and queuing. They can be simulated from standard Poisson arrivals by time-scaling with the cumulative intensity, whose path is typically generated with a discretization method. However, discretization introduces bias into the simulation results. This paper proposes a method for the exact simulation of point processes with stochastic intensities. The method leads to unbiased estimators. It is illustrated for a point process whose intensity follows an affine jump-diffusion process.
Reducing the Plagiarism Detection Search Space on the Basis of the Kullback-Leibler Distance
Authors: Alberto Barrón-Cedeño, Paolo Rosso, José-Miguel Benedí
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

Automatic plagiarism detection considering a reference corpus compares a suspicious text to a set of original documents in order to relate the plagiarised fragments to their potential source. Publications on this task often assume that the search space (the set of reference documents) is a narrow set where any search strategy will produce a good output in a short time. However, this is not always true. Reference corpora are often composed of a big set of original documents where a simple exhaustive search strategy becomes practically impossible.Before carrying out an exhaustive search, it is necessary to reduce the search space, represented by the documents in the reference corpus, as much as possible. Our experiments with the METER corpus show that a previous search space reduction stage, based on the Kullback-Leibler symmetric distance, reduces the search process time dramatically. Additionally, it improves the Precision and Recall obtained by a search strategy based on the exhaustive comparison of word n-grams.
A Formal Approach for Estimating Embedded System Execution Time and Energy Consumption
Authors: Gustavo Callou, Paulo Maciel, Ermeson Carneiro, Bruno Nogueira, Eduardo Tavares, Meuse Oliveira,  Jr.
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

This paper presents a formal approach for estimating the execution time and the energy consumption of embedded system using Coloured Petri Net. Experimental results have demonstrated an accuracy of 96% using the proposed formal method in comparison with the values obtained with the hardware platform. In addition to estimation purposes, several properties can be analyzed and verified using the proposed formal model.
Winchesters for multiuser/multitask applications
Authors: Larry Jacob
Venue: Proceedings of the May 16-19, 1983, national computer conference (1983)

The paper addresses the growing need for Winchester disk storage to handle multiuser/multitask applications. The paper reviews key elements necessary for achieving reliable performance, capacity, and fast access (e.g., linear voice coil actuation, closed-loop servo techniques, and processing/packaging methods). High-performance Winchester options for multitasking, how to evaluate them for specific applications, and what the future holds for Winchester technology are also discussed. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A framework for monitoring classifiers&#x2019; performance: when and why failure occurs?
Authors: David A. Cieslak, Nitesh V. Chawla
Venue: Knowledge and Information Systems (2009)

Classifier error is the product of model bias and data variance. While understanding the bias involved when selecting a given learning algorithm, it is similarly important to understand the variability in data over time, since even the One True Model might perform poorly when training and evaluation samples diverge. Thus, it becomes the ability to identify distributional divergence is critical towards pinpointing when fracture points in classifier performance will occur, particularly since contemporary methods such as tenfolds and hold-out are poor predictors in divergent circumstances. This article implement a comprehensive evaluation framework to proactively detect breakpoints in classifiers&#x2019; predictions and shifts in data distributions through a series of statistical tests. We outline and utilize three scenarios under which data changes: sample selection bias, covariate shift, and shifting class priors. We evaluate the framework with a variety of classifiers and datasets.
Privacy-preserving naive Bayes classification on distributed data via semi-trusted mixers
Authors: Xun Yi, Yanchun Zhang
Venue: Information Systems (2009)

Distributed data mining applications, such as those dealing with health care, finance, counter-terrorism and homeland defense, use sensitive data from distributed databases held by different parties. This comes into direct conflict with an individual's need and right to privacy. It is thus of great importance to develop adequate security techniques for protecting privacy of individual values used for data mining. In this paper, we consider privacy-preserving naive Bayes classifier for horizontally partitioned distributed data and propose a two-party protocol and a multi-party protocol to achieve it. Our multi-party protocol is built on the semi-trusted mixer model, in which each data site sends messages to two semi-trusted mixers, respectively, which run our two-party protocol and then broadcast the classification result. This model facilitates both trust management and implementation. Security analysis has showed that our two-party protocol is a private protocol and our multi-party protocol is a private protocol as long as the two mixers do not conclude.
FPGA-based front-end electronics for positron emission tomography
Authors: Michael Haselman, Robert Miyaoka, Thomas K. Lewellen, Scott Hauck, Wendy McDougald, Don Dewitt
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

Modern Field Programmable Gate Arrays (FPGAs) are capable of performing complex discrete signal processing algorithms with clock rates above 100MHz. This combined with FPGA's low expense, ease of use, and selected dedicated hardware make them an ideal technology for a data acquisition system for positron emission tomography (PET) scanner. Our laboratory is producing a high-resolution, small-animal PET scanner that utilizes FPGAs as the core of the front-end electronics. For this next generation scanner, functions that are typically performed in dedicated circuits, or offline, are being migrated to the FPGA. This will not only simplify the electronics, but the features of modern FPGAs can be utilizes to add significant signal processing power to produce higher resolution images. In this paper two such processes, sub-clock rate pulse timing and event localization, will be discussed in detail. We show that timing performed in the FPGA can achieve a resolution that is suitable for small-animal scanners, and will outperform the analog version given a low enough sampling period for the ADC. We will also show that the position of events in the scanner can be determined in real time using a statistical positioning based algorithm.
Evanescent field absorption detection in aqueous solutions using microstructured optical fibers
Authors: X. Yu, G. B. Ren, P. Shum, Y. C. Kwok, S. N. Fu
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

There is a growing interest in microstructured optical fibers (MOFs) for advanced sensors by infiltrating the air-holes with gas, liquid and polymers. The evanescent field overlap with infiltrations is enhanced compared with conventional fibers. The pure silica material is chemically and biologically inert, which well prevents the evaporation of water. Recently, liquid core waveguide cell has become widely used to minimize source light loss to the cell. However, the construction material Teflon&reg; AF, is one of the most expensive commercial polymers. Moreover, it is highly gas permeable, causing problems of enhanced evaporation of water from the internal solution. In this paper, we demonstrate a novel and highly sensitive detection technique of Co2+ absorbance in aqueous solutions using two different structures of microstructured optical fibers (MOF). The evanescent field is numerically investigated in a systematic manner with the variation of structure parameters and wavelength. The effects of solution concentration, effective path-length, temperature stability and bending effect on the absorption sensitivity are explored and compared experimentally. The enhanced evanescent field from the second structure can achieve absorption sensitivity up to 1.6 Mol-1. The sensitivity using longitudinal detection method is at least sixty times higher compared with that using the perpendicular measurement technique
Comparison of OS level and hypervisor server virtualization
Authors: Abbas Asosheh, Mohammad Hossein Danesh
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

As business needs rapidly grow, more dynamic organizations are required to react sooner and better than competitors. Although the infrastructure is important for all events, but the presented service for costumers is more significant. Nowadays datacenter's flexibility seems to be more critical than ever. The business is more complex to manage and maintain these infrastructures to adapt customer's demands. The virtual architecture would be the best tool to respond the current situation. Server virtualization is a vital layer of virtualization's architecture. In this paper different architectures of server virtualization are compared. The functional and nonfunctional parameters will be discussed in three different types of architecture, without any virtualization, OS level and hypervisor. Fault manageability, scalability and more reliable server farm will be achieved by the virtualization deployment.