ppxscal/embedding_network huggingface dataset:
Long Term Trusted Archive Services
Authors: Aleksej Jerman Blazic
Venue: Proceedings of the First International Conference on the Digital Society (2007)

With the transition to paperless environment the e-business and e-government processes demand to prove the existence of data at a specific point of time and to demonstrate the integrity of the data since that time during long term periods is becoming of utmost importance. Through the course of time the true value of electronic content may simply evaporate due to technological progress and incompetence to prove the authenticity of data stored. This paper presents an approach and a solution to the problem of long-term preservation of electronic data for dematerialized business processes. The basic system design and the architecture of a long-term electronic archive service is introducing a protocol and an evidence record syntax that is being standardized within the IETF Long Term Archive and Notarization Service Working Group. The proposed system environment is based PKI-enabled services for creation of long term integrity proofs. Furthermore, the solution contains additional class of services that meet the requirements for long term validity of digitally signed and legally binding documentation.
Publishing a magazine with Linux
Authors: Phil Hughes
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

Since 1994, Linux Journal has been published using primarily Linux-based tools. In this presentation, I will look at how we have developed this Linux-based solution to a real business problem. The presentation will include design tradeoffs, what we have learned from our mistakes, what Linux does for us and where Linux falls short. Specific topics to be covered include: editorial preparation using Linux, Linux (and non-Linux) in layout, producing ancillary products, Linux and the web and general office use of Linux. I will also explore what needs to be added to the Linux tool chest in order for it to be a complete solution. This talk will not be extremely technical. It is intended to look at how to address problems with Linux tools rather than look at the code that solves the problem. It will also help someone understand the production process of a print and web magazine.
A Process Scheduler-Based Approach to NoC Power Management
Authors: F. Li, G. Chen, M. Kandemir, O. Ozturk, M. Karakoy, R. Ramanarayanan, B. Vaidyanathan
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Increasing use of on-chip networks as communication infrastructure in both high performance and low end computing makes it important to consider their power consumption. Several previously proposed approaches to power management in the context of NoCs (network-on-chips) are either pure hardware based or focus exclusively on a single application execution scenario. This paper makes two major contributions. First, it proposes a software-based proactive on-chip network power management scheme that operates under a given process scheduler. Second, it presents a power-aware process scheduling strategy, with the goal of maximizing power savings when we have multiple applications in the system. The paper also evaluates the proposed schemes under the different execution scenarios in the context of NoCs based on a two-dimensional mesh topology and compares them to each other as well as to a previouslyproposed hardware-based network power management scheme. Our experimental evaluation using six data-intensive applications shows that the proposed software based approach is competitive with the hardware based scheme. Also, we found that the power aware scheduling brings significant energy savings.
Infinite series computation of probability of error in BPSK/QPSK OFDM systems with post-FFT phase error
Authors: C. R. N. Athaudage
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

In OFDM systems both time synchronization error and channel estimation error contribute to a post-FFT phase error in the received symbols. The combined effect of this phase error and the channel noise results in bit errors. A numerical technique for evaluating the probability of error due to the post-FFT phase error and channel noise in the context of OFDM (where small constellations such as BPSK and QPSK are used) has not been reported in the literature so far. In this paper, a Fourier series based numerical technique of evaluating the probability of error in OFDM systems is presented. Formulae are derived for probability of error in terms of the phase error variance and channel noise variance for an OFDM system incorporating BPSK and QPSK constellations. A comparison between the numerical results for the proposed technique and the average symbol/bit error rate (SER/BER) estimates obtained through simulation demonstrates the accuracy of the technique.
Base-class composition with multiple derivation and virtual bases
Authors: Lee R. Nackman, John J. Barton
Venue: Proceedings of the 6th conference on USENIX Sixth C++ Technical Conference - Volume 6 (1994)

For systems of C++ classes using virtual functions, writing base classes that only specify virtual member functions and then writing other base classes that only implement those functions improves extensibility. When interface is separated from implementation, both interfaces and implementations can be extended separately by derivation. New classes can then be composed by multiple derivation, combining one interface and one implementation base class. We call this form of composition base-class composition. Programmers familiar with the advantages of base-class composition fail to use it because of the performance penalty of multiple derivation and virtual base classes. Consequently, compiler writers, failing to see extensive applications of multiple derivation and virtual bases, have little incentive to eliminate the performance penalty. We highlight the advantages of the base-class composition pattern and show how the performance penalty can be eliminated by compiler optimization.
Classification of Bovine Reproductive Cycle Phase using Ultrasound-Detected Features
Authors: Idalia Maldonado-Castillo, Mark G. Eramian, Roger A. Pierson, Jaswant Singh, Gregg P. Adams
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

Studies of ovarian development in female mammals have shown a relationship between the day in the estrous cycle and the size of the main structures and physiological status of the ovary. This paper presents an algorithm for the automatic classification of bovine ovaries into temporal categories using information extracted from ultrasound images. The temporal classes corresponded roughly to the metestrus, diestrus, and proestrus phases of the bovine reproductive cycle. Features based on the sizes of ovarian structures formed the patterns on which the classification was performed. A Na¨ýve Bayes classifier was able to correctly classify the stage of the estrous cycle for 86.36% of the test patterns. A decision tree classified 100% of the test patterns correctly. The decision tree inference algorithm used to build the classifier constructed a tree that used only two of the five available features indicating that they form a sufficiently rich set of features for robust classification.
The Chameleon: A Pervasive Grid Security Architecture
Authors: Rachid Saadi, Jean Marc Pierson, Lionel Brunie
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

The convergence between Grid and Pervasive computing environments lead to the Pervasive Grids paradigm. This new paradigm gives birth to some new security challenges related to adhoc authentication and privacy protection. In distributed systems, and especially in pervasive grid environments, the users usually face difficulties to obtain permissions to use the resources from the sites they visit. Either they have an account locally, or they can show a certificate obtained beforehand that gives them the access. Problems arise when they arrive in an unknown environment, which is likely to occur in a pervasive grid environment. Ideally, they would like to present only the needed credentials to access the resources. In this paper, we propose the Chameleon architecture based on a trust model for authentication and access control that allows nomadic users to roam from site to site and to gain access to surrounding/remote resources wrt her status in her home site and to the local policy of the site where she is standing. The Chameleon permits users to access pervasive grid resources and to implement adhoc interactions through the local grid site.
Instruction trace compression for rapid instruction cache simulation
Authors: Andhi Janapsatya, Aleksandar Ignjatovic, Sri Parameswaran, Joerg Henkel
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Modern Application Specific Instruction Set Processors (ASIPs) have customizable caches, where the size, associativity and line size can all be customized to suit a particular application. To find the best cache size suited for a particular embedded system, the application(s) is/are executed, traces obtained, and caches simulated. Typically, program trace files can range from a few megabytes to several gigabytes. Simulation of cache performance using large program trace files is a time consuming process. In this paper, a novel instruction cache simulation methodology that can operate directly on a compressed program trace file without the need for decompression is presented. This feature allowed our simulation methodology to have an average speed up of 9.67 times compared to the existing state of the art tool (Dinero IV cache simulator), for a range of applications from the Mediabench suite.
Ideas for projects in undergraduate information assurance and security courses
Authors: Ahmad Ghafarian
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

In this work, we present some ideas for projects that can be used in undergraduate Information Assurance and Security (IAS) courses. The projects range from cryptanalysis of ciphertext, network security, security vulnerability analysis, and programming to demonstrate buffer overflow. The projects can be used in IAS courses such as cryptography, network security, and computer security. Alternatively, they can be used as separate modules in computer science courses such as operating systems, networking, and programming. Some of these projects have been piloted by the author and have achieved their objectives.
Dreams in a nutshell
Authors: Steven Sommer
Venue: Proceedings of the USENIX Windows NT Workshop on The USENIX Windows NT Workshop 1997 (1997)

The Dreams extensions have been developed in order to support distributed real-time applications within the conventional operating system paradigm. To demonstrate the viability of the extensions, they have been implemented within Windows NT. This paper introduces the important components of the Dreams extensions, provides an overview of the implementation, and highlights some of the experiences gained from the implementation.
System architectures and environment modeling for high-speed autonomous navigation
Authors: Richard M. Murray
Venue:  (2006)

Successful high-speed autonomous navigation requires integration of tools from robotics, control theory, computer vision, and systems engineering. This thesis presents work that develops and combines these tools in the context of navigating desert terrain. A comparative analysis of reactive, behavior-based, and deliberative control architectures provides important guidelines for design of robotic systems. These guidelines depend on the particular task and environment of the vehicle. Two important factors are identified which guide an effective choice between these architectures: dynamic feasibility for the vehicle, and predictability of the environment. This is demonstrated by parallels to control theory, illustrative examples, simulations, and analysis of Bob and Alice---Caltech's full-scale autonomous ground vehicle entries in the 2004 and 2005 Grand Challenge races, respectively. Further, new model-based methods are developed for constructing and maintaining estimates of terrain elevation and road geometry. These are demonstrated in simulation and in fully autonomous operation of Alice, including accurate detection and tracking of the centerline of desert roads at speeds up to 5 m/s. Finally, Alice's navigation architecture is presented in full along with experimental results that demonstrate its capabilities.
Lossless Compression of Colour Video Sequence using Optimal Prediction Theory - Octopus
Authors: Stefano Andriani, Giancarlo Calvagno
Venue: Proceedings of the 2007 Data Compression Conference (2007)

In this paper we present a lossless compression algorithm for colour video sequence which exploits the spatial, the spectral and the temporal correlations of a colour video sequence in the RGB colour space using the well-known optimal prediction theory. The main idea is to construct the optimal prediction coefficients estimating an autocorrelation matrix which exploits all these correlations. No colour transformation or motion compensation are applied because reversible colour trans- formations are not able to fully decorrelate the three bands of each frame, and motion compensation remarkably increases the complexity of the updating step of the auto- correlation matrix estimate. Furthermore, the fact that our algorithm is not based on motion compensation lead it to be robust to scene changes.
Variable selection for financial distress classification using a genetic algorithm
Authors: R. K. H. Galveo, V. M. Becerra, M. Abou-Seada
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper is concerned with the use of a genetic algorithm to select financial ratios for corporate distress classification models. For this purpose, the fitness value associated to a set of ratios is made to reflect the requirements of maximizing the amount of information available for the model and minimizing the collinearity between the model inputs. A case study involving 60 failed and continuing British firms in the period 1997-2000 is used for illustration. The classification model based on ratios selected by the genetic algorithm compares favorably with a model employing ratios usually found in the financial distress literature.
The Design of Learning Environments Using Videogames in Formal Education
Authors: Begona Gros
Venue: Proceedings of the The First IEEE International Workshop on Digital Game and Intelligent Toy Enhanced Learning (2007)

The fundamental aim of this contribution is to analyze the design of learning environments using videogames in schools. This analysis is the result of work done by our research team in primary and secondary education in Spain. Our interest is to analyze how content and strategies in education should be learnt via the use of digital games. During the last decade, the amount of research on this field has increased considerably. The problem of integrating videogames into education will lessen over time and, in particular, as a consequence of pedagogical proposals that allow the integration of the experience of play with the learning experience. In this contribution, we describe the pedagogical model for the integration of the videogames used. We analyze the results obtained in relation to those obtained in similar studies. Finally, we consider the most important advantages and disadvantages of the use of videogames in schools.
Analysis of multi-scale molecular dynamics algorithms for simulating biomolecules
Authors: Yuefan Deng
Venue:  (2006)

Molecular dynamics simulations have provided invaluable insight into the properties of biomolecular and other systems. Unfortunately, biomolecular simulations are often computationally demanding due to the large number of particles that involve complex and long-range interactions. With the Ewald summation technique, the long-range pairwise Coulomb interactions, the dominant computational task, can be efficiently and accurately evaluated. Despite this progress, modeling most biomolecular simulations that require very long time scales is still a grand challenge that few researchers can afford to take. However, a new algorithm, the multiple time step (MTS) integration method, can dramatically reduce the computational cost. Nevertheless, the MTS methods can introduce errors and instabilities in certain circumstances. In this dissertation, we analyze the properties of a simple 1D linear system integration with the symplectic reference system propagator (r-RESPA) MTS method. A closed form expression for the time step dependent Hamiltonian which corresponds to r-RESPA integration of the model is derived. This allows us to present an analytical formula for the dependence of the integration accuracy on the short-range force cutoff. A detailed analysis of the force decompositions for the standard Ewald summation method is given. We test the analysis on a realistic system, a protein in water. Under Langevin dynamics with a weak friction coefficient to control temperature and with the SHAKE algorithm to freeze out high frequency vibrations, we show that the five femtosecond (fs) resonance barrier is postponed to approximately 20 fs. An iso-error curve in a system involving the short-range cutoff versus the multiple time step size agrees well with the analytical results. Using r-RESPA to treating long-range interactions results in a six times of increase in efficiency for the distance-based force decomposition with independent Ewald and short-range cutoffs.
Enhanced Semantic Question Answering System for e-Learning Environment
Authors: Ying-Hong Wang, Wen-Nan Wang, Chu-Chi Huang
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

To support an automatic assistant learning and self-paced learning mechanism is the objective in today's e-learning environment. Researches of QA system focus on the following characteristics: understand questioners' questions in the form of nature language; enhance the accuracy of search result, and establish automatic learning mechanism. Base these characteristics, we develop a Semantic English QA system to analyze learners' questions and find the relevant answer from the target course ontology. Firstly, this research uses Link Grammar Parser to analyze the syntactic information from the input sentence. According to the syntactic information, secondly, the following process queries the similar word lists generated from WordNet to extend relevant meaning. Thirdly, the two kinds of information can be used to form a semantic tree. Lastly, the semantic tree will map the Data Structure course ontology and find the relevant contents in order to answer learners.
Human-aware computer system design
Authors: Ricardo Bianchini, Richard P. Martin, Kiran Nagaraja, Thu D. Nguyen, Fábio Oliveira
Venue: Proceedings of the 10th conference on Hot Topics in Operating Systems - Volume 10 (2005)

In this paper, we argue that human-factors studies are critical in building a wide range of dependable systems. In particular, only with a deep understanding of the causes, types, and likelihoods of human mistakes can we build systems that prevent, hide, or at least tolerate human mistakes by design. We propose several research directions for studying how humans impact availability in the context of Internet services. In addition, we describe validation as one strategy for hiding human mistakes in these systems. Finally, we propose the use of operator, performance, and availability models to guide human actions. We conclude with a call for the systems community to make the human an integral, first-class concern in computer system design.
Motion estimation using complex wavelets
Authors: J. Magarey
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

This paper describes a new wavelet-based approach to the motion estimation problem for digital video. A complex-valued discrete wavelet transform is used to decompose each frame into a subsampled directionally bandpass filtered hierarchy. The transform is defined so that at each level there is an approximate correspondence between local translation and coefficient phase shift. This relationship is used to estimate motion within each orientation subband. The estimates are combined over all orientations and scales using a coarse-to-fine refinement strategy to produce a fractional-pel accurate motion field with a directional confidence measure. The technique is suitable for video compression schemes and can also be used for stereo vision and image registration.
K-12 and beyond: the extended engineering pipeline
Authors: H. Kimmel
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

The Center for Pre-College Programs (CPCP) at New Jersey Institute of Technology (USA) offers initiatives and programs designed to increase educational opportunities for inner-city youngsters, and to improve the quality of education at the elementary and secondary schools in the region and the State. The Center and its programs provide the connection between the K-12 sector and the University that creates a K-16 continuum. Engineering is used as the vehicle to involve pre-college populations in technological education and to motivate the population to pursue technological careers. This paper describes the organization of the Center and its programs in order to meet the needs of the pre-college students, their teachers, and other stakeholders. The connection between, the K-12 programs and initiatives and university programs are discussed. The use of engineering as the interface between high school and college is described.
A comprehensive and robust procedure for obtaining the nofit polygon using Minkowski sums
Authors: Julia A Bennell, Xiang Song
Venue: Computers and Operations Research (2008)

The nofit polygon is a powerful and effective tool for handling the geometric requirements of solution approaches to irregular cutting and packing problems. Although the concept was first described in 1966, it was not until the early 90s that the general trend of research moved away from direct trigonometry to favour the nofit polygon. Since then, the ability to calculate the nofit polygon has practically become a pre-requisite for researching irregular packing problems. However, realization of this concept in the form of a robust algorithm is a highly challenging task with few instructive approaches published. In this paper, a procedure using the mathematical concept of Minkowski sums for the calculation of the nofit polygon is presented. The described procedure is more robust than other approaches using Minkowski sum knowledge and includes details of the removal of internal edges to find holes, slits and lock and key positions. The procedure is tested on benchmark data sets and gives examples of complicated cases. Scope and purpose: Cutting and packing problems involving irregular shapes feature in a wide variety of manufacturing processes. Automated solution techniques that can generate packing arrangements more efficiently than current technology that employs user intervention, must be able to handle the complex geometry that arises from these problems. The nofit polygon has been demonstrated to be an effective tool in providing efficient handling of the geometric characteristics of these problems. The paper presents a new algorithmic procedure for deriving this tool.