ppxscal/embedding_network huggingface dataset:
Reductions in interface defects, Dit, by post oxidation plasma-assisted nitridation of GaN-SiO2 interfaces in MOS devices
Authors: C. Bae, G. Lucovsky
Venue: Microelectronic Engineering (2004)

This paper applies remote plasma processing techniques, remote plasma assisted oxidation (nitridation) RPAO(N) and RP enhanced chemical vapor deposition (RPECVD), developed originally for fabrication of Si MOS devices with deposited SiO2, Si3N4 and Si oxynitride alloys, to the formation of device-quality GaN MOS devices. Significant improvements in device performance for GaN SiO2 interfaces are demonstrating by following an RPAO process step that forms the GaN dielectric interface with an interfacial RPAN step prior to the deposition of the SiO2 dielectric film by RPECVD. On-line Auger electron spectroscopy is used to monitor interface bonding for different ordering of RPAO and RPAN process steps.
Architectures in context: on the evolution of business, application software, and ICT platform architectures
Authors: A. T. M. Aerts, J. B. M. Goossenaerts, D. K. Hammer, J. C. Wortmann
Venue: Information and Management (2004)

This paper distinguishes between the business domain, the application software domain, and the Information and Communication Technology (ICT) platform domain. It analyses historical developments in each of these three domains and shows that they experienced parallel development. The parallelism can be explained by mutual influence and alignment. Innovation in one domain may enable or drive developments in another. In order to be able to analyse alignment patterns, the notions of business architecture, application software architecture, and ICT platform architecture are introduced and defined. Interdependent historical developments sometimes demonstrate a radical change. Each can be described as a shift in "dominant design", and we identify six such changes in the history of the modern enterprise. Professionals and scientific researchers working in Information and Management can benefit from these insights by assuming that radical changes in dominant designs will affect their field in the future according to the same pattern.
A Signed Digit Adder with Error Correction and Graceful Degradation Capabilities
Authors: G. C. Cardarilli, M. Ottavi, S. Pontarelli, M. Re, A. Salsano
Venue: Proceedings of the International On-Line Testing Symposium, 10th IEEE (2004)

This paper proposes a methodology to obtain fault localizationand graceful degradation of a self-checking adderbased on signed digit representation. The main idea underlyingthe paper is to exploit the fact that in signed digitarithmetic the carry operation is confined to neighbor digits.The usage of a "carry free" adder implies some advantagesin terms of error detection, fault localization andrepair. For the detection standpoint a parity checker can beeasily applied to detect errors caused by faults belongingto a the considered stuck-at fault set. Regarding the faultlocalization the "carry free" property of the adder ensuresthe confinement of the error due to a permanent fault onlyto few digits. Finally, if a fault is correctly localized, thefaulty digit can be excluded and the logic which computesthe other digits can be used to perform the adder operationwith a reduced dynamic range.
Improvements in Distance-Based Indexing
Authors: Murat Tasan, Z. Meral Ozsoyoglu
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

This work offers some improvements in the currentdistance-based indexing techniques. An optimal similaritysearch algorithm that is adopted from vector-based indexingis shown to be also optimal for distance-based indices.Further similarity between the two types of indexingis revealed, leading to a general description of searchstructures. A probabilistic analysis of distance-based treeindices is also shown to be possible, allowing direct comparisonsof structures without the need for extensive experimentation.This analysis will lend itself to future improvedindex construction algorithms.
An Automated Multilevel Substructuring Method for Eigenspace Computation in Linear Elastodynamics
Authors: Jeffrey K. Bennighof, R. B. Lehoucq
Venue: SIAM Journal on Scientific Computing (2004)

We present an automated multilevel substructuring (AMLS) method for eigenvalue computations in linear elastodynamics in a variational and algebraic setting. AMLS first recursively partitions the domain of the PDE into a hierarchy of subdomains. Then AMLS recursively generates a subspace for approximating the eigenvectors associated with the smallest eigenvalues by computing partial eigensolutions associated with the subdomains and the interfaces between them. We remark that although we present AMLS for linear elastodynamics, our formulation is abstract and applies to generic H1-elliptic bilinear forms.In the variational formulation, we define an interface mass operator that is consistent with the treatment of elastic properties by the familiar Steklov--Poincaré operator. With this interface mass operator, all of the subdomain and interface eigenvalue problems in AMLS become orthogonal projections of the global eigenvalue problem onto a hierarchy of subspaces. Convergence of AMLS is determined in the continuous setting by the truncation of these eigenspaces, independent of other discretization schemes.The goal of AMLS, in the algebraic setting, is to achieve a high level of dimensional reduction, locally and inexpensively, while balancing the errors associated with truncation and the finite element discretization. This is accomplished by matching the mesh-independent AMLS truncation error with the finite element discretization error. Our report ends with numerical experiments that demonstrate the effectiveness of AMLS on a model problem and an industrial problem.
Sense of direction, topological awareness and communication complexity
Authors: Nicola Santoro
Venue: ACM SIGACT News (1984)

Based on some recent results, it is here argued that the communication complexity of distributed problems can be greatly affected by two factors hereby identified as 'sense of direction' and 'topological awareness'. It is also suggested that 'insensitivity' to either or both factors is an indicator of the inherent difficulty of a distributed problem. A bibliography of recent results is included.
Light-weight multicast services (LMS): a router-assisted scheme for reliable multicast
Authors: Christos Papadopoulos, Guru Parulkar, George Varghese
Venue: IEEE/ACM Transactions on Networking (TON) (2004)

Building on the success of unicast IP, IP Multicast adopted a simple, open, best-effort delivery model with many-to-many semantics. Despite several years of effort, a general, scalable and reliable end-to-end transport protocol analogous to TCP has proven elusive. Proposed solutions are either inflexible, or incur high control overhead.We present Lightweight Multicast Services (LMS), which enhance the IP Multicast model with simple forwarding services to facilitate scalable and efficient (compared to pure end-to-end) solutions to problems such as reliable multicast. In LMS, routers tag and steer control packets to preselected endpoints and perform fine-grain multicast to guide responses to a subset of the group without transport-level processing.LMS divides error control into transport and forwarding components, which allows the former to remain at the end-points while the latter is pushed to the routers, where it can be implemented very efficiently. The division is clean, resulting in significant gains in performance and scalability, while reducing application complexity. LMS reaches beyond reliable multicast to applications such as scalable collect, any-cast, and in general, any application that can benefit from a hierarchy congruent with the underlying topology.
The Research of Semantic Content Applied to Brain CT Images
Authors: Yumei Miao, Yimin Wang, Yusong Miao
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

The brain CT image database is the result of the efforts made at the No.161 CenterHospital for accurately diagnosing encephalic illness. How to prevent the man-made errorand improve the interpret level for brain CT images, is the purpose of this database, also forour paper. So the intelligent brain CT image retrieval process become important. In ourpaper, we discuss four stages in content-based semantic retrieval. Finally, we apply a newcomplex similarity query algorithm to fulfill the image retrieval.
$C^2,\alpha$ Existence Result for a Class of Shape Optimization Problems
Authors: Arian Novruzi
Venue: SIAM Journal on Control and Optimization (2004)

In this paper we give a sufficient condition for the existence of regular optimal domains for a class of shape optimization problems. This consists of finding a $C^{2,\alpha}$ domain minimizing locally a shape functional depending on the perimeter of the domain and on a general term, which in most PDE applications represents the energy associated with the state equation, under the constraint that the measure of the domain is given. The proof of this result is based on another existence result for $C^{2,\alpha}$ solutions for a class of free boundary problems that are critical domains for the shape functionals considered previously. A key point is the introduction of a special domain transformation, which has a separate term responsible for the domain translation and another which is basically only responsible for "pure" deformation of the domain. As an application, a typical example involving the Dirichlet problem in RN is considered.
Embedded System Security
Authors: Philip Koopman
Venue: Computer (2004)

Security for embedded systems involves issues beyond those problems currently being addressed for enterprise and desktop computing.
Hash-based Placement and Processing for Efficient Node Partitioned Query-Intensive Databases
Authors: Pedro Furtado
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

This paper discusses efficient hash-partitioning usingworkload access patterns to place and process relationsin a cluster or distributed query-intensive databaseenvironment.In such an environment, there is usuallymore than one partitioning alternative for each relation.We discuss a method and algorithm to determine the haspartitioning attributes and placement.Among thealternatives, our algorithm chooses a placement thatreduces repartitioning overheads using expected orhistorical query workloads.The paper includes asimulation study showing how our strategy outperformsad-hoc placement and previously proposed distributeddatabase strategies.
Assigning identifiers to documents to enhance the clustering property of fulltext indexes
Authors: Fabrizio Silvestri, Salvatore Orlando, Raffaele Perego
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Web Search Engines provide a large-scale text document retrieval service by processing huge Inverted File indexes. Inverted File indexes allow fast query resolution and good memory utilization since their d-gaps representation can be effectively and efficiently compressed by using variable length encoding methods. This paper proposes and evaluates some algorithms aimed to find an assignment of the document identifiers which minimizes the average values of d-gaps, thus enhancing the effectiveness of traditional compression methods. We ran several tests over the Google contest collection in order to validate the techniques proposed. The experiments demonstrated the scalability and effectiveness of our algorithms. Using the proposed algorithms, we were able to sensibly improve (up to 20.81%) the compression ratios of several encoding schemes.
Oscillations and buffer overflows in video streaming under non-negligible queuing delay
Authors: Yueping Zhang, Dmitri Loguinov
Venue: Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video (2004)

In this paper, we analyze how feedback delays affect stability, oscillations, and packet loss of several classes of congestion controllers used or proposed for video streaming in the current/future Internet (including window-based AIMD, rate-based AIMD, Scalable TCP, and TFRC). Our results indicate that window-based protocols in this list incur significantly less packet loss under delayed feedback than their rate-based counterparts, which explains their better overall performance observed in practice [12]. At the same time, we show that even TCP's congestion control is far from ideal from the control-theoretic point of view and leads to amplified oscillations when queuing delays increase. We conclude with an observation that multimedia in the future Internet is not likely to enjoy oscillation-free congestion control unless the network deploys some form of AQM.
Embedding Semantic Annotations into Dynamic Web Contents
Authors: Ismael Navas-Delgado, Nathalie Moreno-Vergara, Antonio C. Gomez-Lora, Maria del Mar Roldan-Garcia, Ivan Ruiz-Mostazo, Jose F. Aldana-Montes
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

The Semantic Web explosion has not yet been accompanied by efficient search engines or intelligent applications that can exploit semantic query capabilities. This is the reason why the amount of semantically annotated web pages is still very small compared to the total amount of information on the Web. In this sense, there have been several approaches that deal with the semantic annotation of static web pages. However, they do not support the annotation of dynamically generated web content. This paper offers two main contributions: first, the automatic generation of a function that dynamically calculates annotations for a web document; secondly, a novel approach for annotating dynamic web documents by annotating the queries enveloped in each document and their results.
From the Editor: The Dangers of End-User Programming
Authors: Warren Harrison
Venue: IEEE Software (2004)

We cannot expect secure computing from the vast majority of software applications when theyýre written with little, if any, knowledge of generally accepted good practices such as specifying before coding, systematic testing, and so on. Although using professional programmers doesnýt guarantee correctness, security, or maintainability, the lack of real understanding about software development by end-user programmers poses a danger to stakeholders associated with mission-critical systems from the standpoints of both correctness and security.
The Results of SEASTAR2000 and Related Projects in ASEAN Countries
Authors: Nobuaki Arai
Venue: Proceedings of the International Conference on Informatics Research for Development of Knowledge Society Infrastructure (2004)

The Southeast Asia sea turtle associative research(SEASTAR2000) was started in 1999 by the request ofthe Thai government. The research focused on trackingsea turtles using the Argos system. The results of theresearch clarified migratory paths of adult femalegreen turtles after their nesting. In order to measurefine scale turtle behaviors, the project includeddevelopment of new devices including a magnetic fieldsensor accelerometer tag (MR tag), a GPS-Argosplatform terminal transmitter (GPS-Argos PTT) and avisual data storage tag (CCD tag). Based on thesuccessful results of the SEASTAR2000, the Thaigovernment requested us to investigate migrationbehavior for the Mekong giant catfish as well as seaturtles. The Mekong giant catfish is endemic to theMekong River but an endangered species now.Mekong giant catfish tracking project (MCTP) wasstarted in 2002. The project was performed usingcoded ultrasonic transmitters in Mekong River.
Exact and approximation algorithms for computing optimal fat decompositions
Authors: Mirela Damian
Venue: Computational Geometry: Theory and Applications (2004)

The minimum α-fat decomposition problem is the problem of decomposing a simple polygon into fewest subpolygons, each with aspect ratio at most α, for a given α > 0. The main result in the paper is a polynomial time algorithm that solves the version of this problem that disallows Steiner points. The algorithm returns an optimal α-fat decomposition, if there is one, and reports failure otherwise. We also devise a faster approximation algorithm that produces, for any ε > 0, an (α + ε)-fat decomposition with as few polygons as an optimal α-fat decomposition.
Heterogeneity Resolution based on Ontology in Web Services Composition
Authors: Shen Derong, Yu Ge, Yin Nan, Nie Tiezheng
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

Heterogeneity issues in Web services composition are discussed and classified into heterogeneity between semantic equivalent Web services and heterogeneity between sequent Web services in a process flow. we induce these heterogeneity issues into six types of conflicts, namely semantic conflict, data type conflict, Structure conflict, parameter number conflict, data unit conflict and data precision conflict. Then, an ontology based conflict resolution is designed, including the definition of domain ontology knowledge for business specification, the definition of domain and industry terms ontology knowledge for describing the profile information of Web services and the definition of meta-ontology knowledge for transformation. Furthermore, the implementation issues are presented.
High-end server low-temperature cooling
Authors: R. Schmidt, B. D. Notohardjono
Venue: IBM Journal of Research and Development (2002)

The IBM S/390Â® G4 CMOS system, first shipped in 1997, was the first high-end system to use refrigeration. The decision to employ refrigeration cooling instead of other cooling options such as high-flow air cooling or various water-cooling schemes focused on the potential system performance improvement obtainable by lowering coolant temperatures using a refrigeration system. This paper reviews the historical background of refrigeration from its use in the early 1800s to its implementation in computer systems in the early 1990s. The advantages and disadvantages of using refrigeration in the cooling of computer systems are examined. The advantages have outweighed the disadvantages, leading to the first use by IBM of refrigeration in cooling the S/390 G4 server. The design of the refrigeration system for the S/390 G4 system is described in detail, and some of the key parametric studies that contributed to the final design are described.
Conceptual construction on incomplete survey data
Authors: Shouhong Wang, Hai Wang
Venue: Data Knowledge Engineering (2004)

The raw survey data for data mining are often incomplete. The issues of missing data in knowledge discovery are often ignored in data mining. This article presents the conceptual foundations of data mining with incomplete survey data, and proposes query processing for knowledge discovery and a set of query functions for the conceptual construction in survey data mining. Through a case, this paper demonstrates that conceptual construction on incomplete data can be accomplished by using artificial intelligence tools such as self-organizing maps.
Limiting strategies for polynomial reconstructions in the finite volume approximation of the linear advection equation
Authors: Enrico Bertolazzi, Gianmarco Manzini
Venue: Applied Numerical Mathematics (2004)

A cell-centered semi-discrete finite volume method is proposed to accurately solve the time-dependent scalar advection equation. The spatial accuracy is ensured by a piecewise linear reconstruction which requires a suitable limiting strategy to control spurious numerical oscillations. Three different approaches are conceived to limit the approximate solution.
CapProbe: a simple and accurate capacity estimation technique for wired and wireless environments
Authors: Rohit Kapoor, Ling-Jyh Chen, Alok Nandan, Mario Gerla, M. Y. Sanadidi
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

The problem of estimating the capacity of an Internet path is one of fundamental importance. Due to the multitude of potential applications, a large number of solutions have been proposed and evaluated. The proposed solutions so far have been successful in partially addressing the problem, but have suffered from being slow, obtrusive or inaccurate. In this work, we evaluate CapProbe, a low-cost and accurate end-to-end capacity estimation scheme that relies on packet dispersion techniques as well as end-to-end delays. The key observation that enabled the development of CapProbe is that both compression and expansion of packet pair dispersion are the result of queuing due to cross-traffic. By filtering out queuing effects from packet pair samples, CapProbe is able to estimate capacity accurately in most environments, with minimal processing and probing traffic overhead. In fact, the storage and processing requirements of CapProbe are orders of magnitude smaller than most of the previously proposed schemes. We tested CapProbe through simulation, Internet, Internet2 and wireless experiments. We found that CapProbe error percentage in capacity estimation was within 10% in almost all cases, and within 5% in most cases.
SINBAD: A neocortical mechanism for discovering environmental variables and regularities hidden in sensory input
Authors: Oleg V. Favorov, Dan Ryder
Venue: Biological Cybernetics (2004)

We propose that a top priority of the cerebral cortex must be the discovery and explicit representation of the environmental variables that contribute as major factors to environmental regularities. Any neural representation in which such variables are represented only implicitly (thus requiring extra computing to use them) will make the regularities more complex and therefore more difficult, if not impossible, to learn. The task of discovering such important environmental variables is not an easy one since their existence is only indirectly suggested by the sensory input patterns the cortex receives &#x2013; these variables are &#x201c;hidden&#x201d;. We present a candidate computational strategy for (i) discovering regularity-simplifying environmental variables, (ii) learning the regularities, and (iii) using regularities in perceptual and decision-making tasks. The SINBAD computational model discovers useful environmental variables through a search for different, but nevertheless highly correlated, functions of any kind over nonoverlapping subsets of the known variables, this being indicative of some important environmental variable that is responsible for the correlation. We suggest that such a search is performed in the neocortex by the dendritic trees of individual pyramidal cells. According to the SINBAD model, the basic function of each pyramidal cell is to (i) discover and represent one of the regularity-simplifying environmental variables and (ii) learn to infer the state of its variable from the states of other variables, represented by other pyramidal cells. A network of such cells &#x2013; each cell just attending to representation of its variable &#x2013; can function as a sophisticated and useful inferential model of the outside world.