ppxscal/embedding_network huggingface dataset:
Composition, chemical structure, and electronic band structure of rare earth Oxide/Si(100) interfacial transition layer
Authors: T. Hattori, T. Yoshida, T. Shiraishi, K. Takahashi, H. Nohira, S. Joumori, K. Nakajima, M. Suzuki, K. Kimura, I. Kashiwagi, C. Ohshima, S. Ohmi, H. Iwai
Venue: Microelectronic Engineering (2004)

The experimental data for Gd2O3, as a typical example of rare earth oxide films, clearly indicate that combination of high resolution RBS and high resolution XPS studies is powerful for the determination of composition and chemical structures of high-k dielectric films. Conduction and valence band discontinuities at rare earth oxide/Si(100) interfaces were also determined by measuring the O 1s photoelectron energy loss and valence band spectra.
Can students improve their undergraduate schievements and get accepted to graduate school?
Authors: Tamar Benaya, Ela Zur
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

The Open University of Israel offers an MSc program in Computer Science for students with an undergraduate degree in Computer Science and a grade point average of at least 80. We will describe an experiment which we began a year ago in which we give an opportunity to those students who do not meet the requirements (average lower than 80) to improve their achievements.
The Architecture of the Symbol Engine in a Programmable Autonomous Business
Authors: Nick V. Flor
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

A programmable autonomous business is a kind of online software agent whose function is not to collect or synthesize information for people, but rather to gather and generate customers and income for entrepreneurs. Functionally and compositionally autonomous businesses are indistinguishable from conventional ones. However, an autonomous business is built entirely in software and capable of operating profitably without any employees or managers guiding it. This paper analyses an instance of a successful autonomous business ¿ uncovering the processes driving the production of its symbols. A general architecture for symbol engines is induced from these processes. The paper discusses how this architecture applies to other successful autonomous businesses, and concludes with a set of design requirements for symbol engines in autonomous businesses.
Fast Environmental Lighting for Local-PCA Encoded BTFs
Authors: Gero Muller, Jan Meseth, Reinhard Klein
Venue: Proceedings of the Computer Graphics International (2004)

Rendering geometric models with complex surfacematerials in arbitrary lighting environments is a challengingproblem. In order to relight and render geometriescovered with complex, measured BTFs twoproblems have to be addressed: The memory problemresulting from the large size of the measured BTF dataand the light integration problem resulting from summingup the contributions from all measured light-sources.In this paper we describe how highly efficient BTFcompression methods like Local-PCA and suitablerepresentations of environmental light based onSpherical Harmonics can be combined leading to fastenvironmental lighting for efficiently encoded BTFs.As a side effect the method supports Precomputed RadianceTransfer.
Multimedia Description Language for More Intelligent Networking
Authors: Daisuke Hironaka, Masao Yokota
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

In general, it is very difficult for people to exploit necessary information from the immense multimedia contents over the WWW. It is still more difficult to search for desirable contents by queries in different media, for example, text queries for pictorial contents. In this case, intelligent systems facilitating cross-media translation are very helpful. Mental Image Directed Semantic Theory (MIDST) has proposed a cognitively motivated methodology for intermediate knowledge representation. This paper presents a formal language for describing multimedia contents, Lmd , whose syntax and semantics are based on MIDST and its application to cross-media translation between linguistic and pictorial expressions of space and time, which we think will serve as a good basis for more intelligent networking.
Smarandache sequence of happy cube numbers
Authors: Muneer Jebreel
Venue: Smarandache Notions Journal (2004)

I have studied the Smarandache Happy Cube Numbers and I have got some interesting results and facts. I have discovered some open problems about the Happy Cube and Smarandache Happy Cube Numbers.
A hybrid statistical/linguistic model for generating news story gists
Authors: William P. Doran, Nicola Stokes, Eamonn Newman, John Dunnion, Joe Carthy
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

In this paper, we describe a News Story Gisting system that generates a 10-word short summary of a news story. This system uses a machine learning technique to combine linguistic, statistical and positional information in order to generate an appropriate summary. We also present the results of an automatic evaluation of this system with respect to the performance of other baseline summarisers using the new ROUGE evaluation metric.
Words to the wise
Authors: Ken Korman
Venue: netWorker (2002)

"Digital content is getting a lot of attention---but not at the board level, where it is urgently needed .... Media companies are focusing too much on encryption and other defensive technologies while failing to develop proactive strategies that recognize and leverage their intellectual property assets. Protection remains vital, but innovative business models are also needed to derive new revenue from digital content."
Effectiveness of vendor-managed inventory in the electronics industry: determinants and outcomes
Authors: George Kuk
Venue: Information and Management (2004)

This study used the extended limits-to-value model to frame four research hypotheses related to the effects of organizational size, employee involvement, and logistics integration on the expected and perceived values of vendor-managed inventory (VMI) as implemented in the electronics industry. Most of the findings supported the hypotheses. Specifically, that supply chain members working for organizations with high levels of employee involvement and logistics integration were more likely to realize the potential values of VMI. However, contrary to the notion that large organizations have more slack resources in technology adoption and implementation, VMI benefited small organizations most.
Designs for learning: ICT and knowledge in the classroom
Authors: Rosamund Sutherland
Venue: Computers Education (2004)

What has not yet been fully understood is that computer-based technologies can be powerful pedagogical tools--not just rich sources of information, but extensions of human capabilities and contexts for social interactions supporting learning. The process of using technology to improve learning is never solely a technical matter, concerned only with properties of educational hardware and software. Like a textbook or any other cultural object, technology resources for education function in a social environment, mediated by learning conversations with peers and teachers.
Password-based user authentication and key distribution protocols for client-server applications
Authors: Her-Tyan Yeh, Hung-Min Sun
Venue: Journal of Systems and Software (2004)

Up to now, most of the literature on three-party authentication and key distribution protocols has focused on the environment in which two users (clients) establish a session key through an authentication server. In this paper, we discuss another environment in which a user (client) requests service from an application server through an authentication server. We propose two secure and efficient authentication protocols (KTAP: key transfer authentication protocol and KAAP: key agreement authentication protocol) to fit this environment. These two proposed protocols can be efficiently applied to various communication systems in distributed computing environments since they provide security, efficiency, and reliability.
Face Detection System Based on Feature-Based Chrominance Colour Information
Authors: Y. H. Chan, S. A. R. Abu-Bakar
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

This paper presents a novel face detection system based on feature-based chrominance colour information from an image containing one face in indoor environment with non-uniform background. The face detection algorithm is based on the Adapted Chain Code (ACC), eye detection and Modified Golden Ratio (MGR). ACC is proposed to obtain a face boundary. MGR attempts to extract part of a face that includes eyes, eyebrows, nose and mouth, based on the detected eyesý positions. Experimental results show that the proposed algorithm is able to detect a face of near frontal with high accuracy. The database consists of faces with and without spectacles, wearing headscarf and without wearing headscarf.
Information Security on the Logistical Network: An End-to-End Approach
Venue: Proceedings of the Second IEEE International Security in Storage Workshop (2003)

We describe the information security aspects of logisticalnetworking. The security model adopted by logistical networkingis an end-to-end model that provides tunable securitylevels while maintaining the scalability of the networkas a whole.
A divide-and-conquer algorithm for the eigendecomposition of symmetric block-diagonal plus semiseparable matrices
Authors: S. Chandrasekaran, M. Gu
Venue: Numerische Mathematik (2004)

We present a fast and numerically stable algorithm for computing the eigendecomposition of a symmetric block diagonal plus semiseparable matrix. We report numerical experiments that indicate that our algorithm is significantly faster than the standard method which treats the given matrix as a general symmetric dense matrix.
Scaling the issue window with look-ahead latency prediction
Authors: Yongxiang Liu, Anahita Shayesteh, Gokhan Memik, Glenn Reinman
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

In contemporary out-of-order superscalar design, high IPC is mainly achieved by exposing high instruction level parallelism (ILP). Scaling issue window size can certainly provide more ILP; however, future processor scaling demands threaten to limit the size of the issue window.In this study, we propose a dynamic instruction sorting mechanism that provides more ILP without increasing the size of the issue window. In our approach, early in the pipeline, we predict how long an instruction needs to wait before it can be issued, i.e. the waiting time for its operands to be produced. Using this knowledge, the instructions are placed into a sorting structure, which allows instructions with shorter waiting times enter the issue window ahead of those instructions with longer waiting times, preventing long-waiting instructions from clogging the issue queue.The accuracy in predicting instruction waiting times directly determines the effectiveness of our sorting mechanism. While most instructions have deterministic execution latencies, predicting load execution times is more difficult due to cache misses and in-flight loads. Loads are particularly challenging since their execution time can vary significantly. In this study, we examine techniques to predict load execution time accurately, based on data reference history.
Efficient Method of Input Variable Partitioning in Functional Decomposition Based on Evolutionary Algorithms
Authors: Mariusz Rawski, Henry Selvaraj, Pawel Morawiecki
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

In recent years the functional decomposition has found an application in many fields of modern engineering and science, such as combinational and sequential logic synthesis for VLSI systems, pattern analysis, knowledge discovery, machine learning, decision systems, data bases, data mining etc. However, the lack of an effective and efficient method of the input variable partitioning limits its practical usefulness in complex systems. A classical method based on a systematic search of the whole solution space is inefficient due to its non-polynomial time complexity. In this paper, a heuristic method for the input variable partitioning is proposed and discussed. The method is based on the application of evolutionary algorithms that allows exploring the possible solution space of a problem while keeping the high-quality solutions in this reduced space. The experimental results show that the proposed heuristic method is able to construct an optimal or near optimal solution very efficiently even for large systems. It is much faster than the systematic method while delivering results of comparable quality.
Approaching Interoperability from the Bottom up: A Lattice Structure for the Object-Oriented Method for Interoperability (OOMI)
Authors: George M. Lawler, Paul E. Young
Venue: Proceedings of the 15th IEEE International Workshop on Rapid System Prototyping (2004)

Software prototyping often incorporates existing componentsand systems with newly developed code in orderto rapidly achieve the goals of the prototyping effort.Unfortunately, heterogeneities among component systemsoften make system interoperability difficult, potentiallyreducing the benefit of such an approach. Achievinginteroperability among heterogeneous system componentsis necessary in order to take advantage of thebenefits that the use of existing elements brings to prototypedevelopment. The predominant approach toachieving interoperability among heterogeneous componentsinvolves the development of an intermediaterepresentation. An example is Youngýs Object-OrientedMethod for Interoperability (OOMI), which produces abottom-up model for the resolution of heterogeneityamong component systems. We describe here how tomanage the complexity of the bottom-up approachthrough the use of self-similar components that supportscalability, and a lattice structure that limits complexity.
Complexity of one-cycle robotic flow-shops
Authors: N. Brauner, G. Finke, W. Kubiak
Venue: Journal of Scheduling (2003)

We study the computational complexity of finding the shortest route the robot should take when moving parts between machines in a flow-shop. Though this complexity has already been addressed in the literature, the existing attempts made crucial assumptions which were not part of the original problem. Therefore, they cannot be deemed satisfactory. We drop these assumptions in this paper and prove that the problem is NP-hard in the strong sense when the travel times between the machines of the cell are symmetric and satisfy the triangle inequality. We also impose no restrictions on the times of robot arrival at and departure from machines as it is the case in the related, but different, hoist scheduling problem. Our results hold for processing times equal on all machines in the cell. However, the equidistant case for equal processing times can be solved in O(1) time.
Fuzzy logic deduction with crisp observations
Authors: A. Dvo&#x0159;&#x00e1;k, V. Nov&#x00e1;k
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2004)

This paper presents an approach to approximate reasoning over a set of IF-THEN rules called fuzzy logic deduction. It understands IF-THEN rules as linguistically expressed logical implications and interprets them inside formal logical theory. Methodology and some properties are presented.
Bipartite Subgraphs and Quasi-Randomness
Authors: Jozef Skokan, Lubos Thoma
Venue: Graphs and Combinatorics (2004)

We say that a family of graphs * is p-quasi-random, 0<p<1, if it shares typical properties of the random graph G(n,p); for a definition, see below. We denote by * the class of all graphs H for which * and the number of not necessarily induced labeled copies of H in Gn is at most (1+o(1))pe(H)nv(H) imply that * is p-quasi-random. In this note, we show that all complete bipartite graphs Ka,b, a,b&#x2265;2, belong to * for all 0<p<1.
Model-Driven Reverse Engineering
Authors: Spencer Rugaber, Kurt Stirewalt
Venue: IEEE Software (2004)

Managing software maintenance projects is difficult, particularly when the project being managed includes programs written by a different group or even a different company. Reverse engineering is an attractive technique to help understand a foreign program, but managing reverse-engineering efforts is difficult due to the lack of fixed standards for productivity and quality. Model-driven reverse engineering can help solve this problem. In particular, MDRE uses models to predict how much time a reverse-engineering effort will require and to provide a quality standard to evaluate that effort. This, in turn, enables better effort prediction and quality evaluation, reducing development risk. This article describes a particular approach to MDRE and presents an example of its use.
The blit debugger: preliminary draft
Authors: Thomas A. Cargill
Venue: ACM SIGSOFT Software Engineering Notes (1983)

This paper describes the evolution to date of a flexible debugger for C programs on the Blit, a multi-processing bitmap terminal. The debugger is of interest for the following reasons: -- it is assisted by the terminal software's elegant separation of the debugger process from its subject process. -- it resides autonomously in the terminal and is bound dynamically to arbitrary subject processes. -- it executes asynchronously with its subject. -- its implementation is distributed as a small process in the terminal and a large process in the host timesharing system. -- its user interface uses graphics and a mouse. An opinion about the most fruitful direction for further application of graphics is offered.
Image and exchange-correlation effects in double gate Silicon-on-insulator transistors
Authors: F. Gámiz, P. Cartujo-Cassinello, F. Jiménez-Molinos, J. E. Carceller, P. Cartujo
Venue: Microelectronic Engineering (2004)

We have studied the influence of the image and exchange-correlation effects in double-gate silicon on insulator (DGSOI) devices, in the calculation of both charge distribution and of electron mobility. We find that the image and exchange correlation potentials produce a greater confinement of the carriers and, according to the uncertainty principle, a greater phonon scattering rate, which produces a decrease in electron mobility. We have also observed that the influence of image and exchange-correlation potentials on electron mobility, while almost negligible for bulk silicon inversion layers, becomes increasingly important as the silicon thickness decreases, due to the effect of volume inversion in DGSOI reversion layers. It is thus essential to take these effects into account in order to correctly evaluate the inversion charge distribution and the electron mobility in DGSOI inversion layers.
On the p-Ranks and Characteristic Polynomials of Cyclic Difference Sets
Authors: Jong-seon No, Dong-joon Shin, Tor Helleseth
Venue: Designs, Codes and Cryptography (2004)

In this paper, the p-ranks and characteristic polynomials of cyclic difference sets are derived by expanding the trace expressions of their characteristic sequences. Using this method, it is shown that the 3-ranks and characteristic polynomials of the Helleseth&ndash;Kumar&ndash;Martinsen (HKM) difference set and the Lin difference set can be easily obtained. Also, the p-rank of a Singer difference set is reviewed and the characteristic polynomial is calculated using our approach.
Natural Language Processing Technologies to Enhance Readability
Authors: Satoshi Sato, Takehito Utsuro, Masatoshi Tsuchiya, Masahiro Asaoka, Suguru Matsuyoshi
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

Language Media Laboratory at Kyoto University conductsa project that aims to develop natural language processingtechnologies that enhance readability of Japanesetexts: machine-assisted language control with automaticparaphrasing. In this paper, we describe an overview andthe current status of this project.
Search-Space Reduction of a Non-Redundant Peptide Database
Authors: Ian Shadforth, Daniel Crowther, Conrad Bessant
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Peptide mass fingerprinting and database searching with tandem mass spectrometry are two methods commonly employed to identify proteins in a sample. However, up to 90% of peptides can remain unidentified. In this paper, a search-space filter using amino acids identified by a novel de novo methodology is presented. This provides a high-accuracy set of amino acid predictions through exploiting the internal fragmentation of amino acid chains during tandem mass spectrometry. These predictions are used to reduce the number of peptides considered from a non-redundant peptide database. The presence of one confirmed amino acid can be used to reduce the search-database size by between 33% (Leucine) and 83% (Tryptophan). One or more accurate amino acid identifications are made in 18% of simulated and 9% of experimental peptide spectra considered. Given the large proportion of currently unidentified peptides, this method represents a useful tool for increasing peptide identification rates.
Vertical and horizontal percentage aggregations
Authors: Carlos Ordonez
Venue: Proceedings of the 2004 ACM SIGMOD international conference on Management of data (2004)

Existing SQL aggregate functions present important limitations to compute percentages. This article proposes two SQL aggregate functions to compute percentages addressing such limitations. The first function returns one row for each percentage in vertical form like standard SQL aggregations. The second function returns each set of percentages adding 100% on the same row in horizontal form. These novel aggregate functions are used as a framework to introduce the concept of percentage queries and to generate efficient SQL code. Experiments study different percentage query optimization strategies and compare evaluation time of percentage queries taking advantage of our proposed aggregations against queries using available OLAP extensions. The proposed percentage aggregations are easy to use, have wide applicability and can be efficiently evaluated.
Cellular automata with vanishing particles
Authors: Petr Kůrka
Venue: Fundamenta Informaticae (2003)

We consider particle weight functions which assign weights to certain words. Given a cellular automaton, we search for particle weight functions, for which the total weights of configurations do not increase with time. In this case the weight of a shift-invariant Borel probability measure does not increase either, so we get a Ljapunov function on the space of measures. We give some conditions which ensure that the weight of a measure converges to zero. In particular we prove that this happens in the elementary cellular automaton rule number 18 and in a variant of the Gacs-Kurdyumov-Levin cellular automaton.
The Dynamic Range of Gene Expressions Depend on Their Ontology
Authors: Yizhou Xie, Soumitra Ghosh, Parthav Jailwalia, Xujing Wang
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

In this study we investigate the correlation between the normal variation of gene expressions and their ontologies. Three sets of time-series microarray data are utilized that represent three different but typical physiological/developmental processes. We analyze the dynamic range and the variation of expression levels during these processes for genes in each of the top-level ontologies of the biological process, molecular function and cellular component, as defined by GO. Significant and consistent differences are observed. For example, transcription factors were found to have consistent narrower dynamic range of expression in all three processes. The findings will shed light on study design, statistical evaluation, and data mining of genetic data including microarray data.