ppxscal/embedding_network huggingface dataset:
Growth of gadolinium oxide films for advanced MOS structure
Authors: R. Lupták, K. Fröhlich, A. Rosová, K. Hušeková, M. Ťapajna, D. Machajdík, M. Jergel, J. P. Espinós, C. Mansilla
Venue: Microelectronic Engineering (2005)

We have investigated properties of insulating gadolinium oxide (Gd2O3) films in connection with the replacement of silicon oxide (SiO2) gate dielectrics in new generation of CMOS devices. The Gd2O3 layers were grown using metal organic chemical vapour deposition at temperature 500 °C. X-ray diffraction showed polycrystalline Gd2O3 films. X-ray photoelectron spectroscopy revealed interface layer, presumably gadolinium silicate. Capacitance-voltage characteristics were used to analyse electrical properties of Ru/Gd2O3/Si structures. The analysis yielded dielectric constant κ = 11.4 and interfacial layer thickness tIF = 1.7 nm.
Supplementing IBM manuals
Authors: Tom Bergeron
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1979)

I like IBM manuals. I think they take some unfair criticism from people, particularly those in Tech Writing seminars, who don't understand the problems their authors are up against (and often enough, have never written a full-size tech manual). 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
Temperature and frequency dependent electrical and dielectric properties of Al/SiO2/p-Si (MOS) structure
Authors: A. Tataroglu, Ş. Altındal, M. M. Bülbül
Venue: Microelectronic Engineering (2005)

The electrical and dielectric properties of Al/SiO"2/p-Si (MOS) structures were studied in the frequency range 10kHz-10MHz and in the temperature range 295-400K. The interfacial oxide layer thickness of 320A between metal and semiconductor was calculated from the measurement of the oxide capacitance in the strong accumulation region. The frequency and temperature dependence of dielectric constant (@e'), dielectric loss (@e''), dielectric loss tangent (tan@d) and the ac electrical conductivity (@s"a"c) are studied for Al/SiO"2/p-Si (MOS) structure. The electrical and dielectric properties of MOS structure were calculated from C-V and G-V measurements. Experimental results show that the @e' and @e'' are found to decrease with increasing frequency while @s"a"c is increased, and @e', @e'', tan@d and @s"a"c increase with increasing temperature. The values of @e', @e'' and tan@d at 100kHz were found to be 2.76, 0.17 and 0.06, respectively. The interfacial polarization can be more easily occurred at low frequencies, and the number of interface state density between Si/SiO"2 interface, consequently, contributes to the improvement of dielectric properties of Al/SiO"2/p-Si (MOS) structure. Also, the effects of interface state density (N"s"s) and series resistance (R"s) of the sample on C-V characteristics are investigated. It was found that both capacitance C and conductance G were quite sensitive to temperature and frequency at relatively high temperatures and low frequencies, and the N"s"s and R"s decreased with increasing temperature. This is behavior attributed to the thermal restructuring and reordering of the interface. The C-V and G/@w-V characteristics confirmed that the N"s"s, R"s and thickness of insulator layer (@d) are important parameters that strongly influence both the electrical and dielectric parameters and conductivity in MOS structures. ctures.
Peers-assisted Dynamic Content Distribution Networks
Authors: Minh Tran, Wallapak Tavanapong
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Content Distribution Networks (CDNs) have been proposed to primarily distribute web and some limited streaming audio/video content over the Internet. Current CDNs consist of fixed content nodes placed at strategic locations on the Internet to improve the service latency and to reduce server and network load. Although the approach of delivering content with a fixed CDN has enjoyed some successes, it is often difficult to upgrade and extend a CDN to serve more users due to a very high deployment cost. In this paper, we propose that a CDN be agile while delivering content. We make the case for a dynamic CDN architecture in which a CDN leverages local peers to deliver the CDN's content to local users. We define a formal problem for using peers to increase the capacity of a CDN and we propose an algorithm to help a CDN to dynamically recruit local peers to be part of the CDN. The CDN and the recruited local peers cooperate to serve content to other local users. Our performance evaluation shows promising results with the new dynamic CDN architecture. Our simple CDN growing strategies dramatically improve the average service latency in streaming video content.
Information access at the data file level: documentation prerequisites on the file-level data base inquiry process
Authors: Per Nielsen
Venue: ACM SIGSOC Bulletin (1974)

In the mid-sixties, political and social science was theory-rich and data-poor. [1] In the decade following this statement, the ever-increasing holdings of machine-readable datasets in a growing chain of data repositories throughout the world have made the social science community much more wealthy. But, the vast scientific potential buried in data repositories is being transformed only at a slow pace. In the mid-seventies, quantitative data generated by empirical political and social science research are still heavily underexploited.
The Role of User Involvement in Requirements Quality and Project Success
Authors: Sari Kujala, Marjo Kauppinen, Laura Lehtola, Tero Kojo
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

A key issue in Requirements Engineering (RE) for Enterprise Resource Planning (ERP) in a crossorganizational context is how to find a match between the ERP application modules and requirements for business coordination. This paper proposes a conceptual framework for analyzing coordination requirements in inter-organizational ERP projects from a coordination theory perspective. It considers the undocumented assumptions for coordination that may have significant implications for ERP adopting organizations. In addition, we build a library of existing coordination mechanisms supported by modern ERP systems, and use it to make a proposal for how to improve the match between ERP implementations and supported business coordination processes. We discuss the implications of our framework for practicing requirements engineers. Our framework and library are based on a literature survey and the experience with ERP implementation of one of us (Daneva). In future empirical research we will further validate and refine our framework.
High-Level Synthesis in Latency Insensitive System Methodology
Authors: P. Bomel, N. Abdelli, E. Martin, A-M. Fouilliart, E. Boutillon, P. Kaifasz
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

This paper presents our contribution in terms of synchronization processor to a SoC design methodology based on the theory of latency insensitive systems (LIS). This methodology 1) promotes pre-developed IPs intensive reuse, 2) segments inter-IP interconnects with relay stationsto break critical paths and 3) brings robustness to data stream irregularities to IPS by encapsulation into a synchronization wrapper. Our contribution consists in IP encapsulation into a new wrapper model containing a synchronization processor, which speed and area are optimized and synthesizability guarantied. The main benejit of our approach is to preserve the local IP performances when encapsulating them. This approach is part of the RNRT ALIPTA project, which targets design automation of intensive digital signal processing systems with GA UT [l], a high-level synthesis tool.
Information Retrieval in Multimedia: Exploiting MPEG-7 Metadata by the Use of Ontologies and Fuzzy Thematic Spaces
Authors: Jean-Sebastien Brunner, Yannick Naudet, Thibaud Latour
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

This paper presents a common framework for the conceptual information of MPEG-7, interoperable with the Semantic Web, and providing high performance search capabilities, using fuzzy set theory and ontology relations. Starting from the meta-data model of the MPEG-7, to which we add few layers while keeping the existent, so as to guarantee compatibility with the standard, we then link MPEG-7 descriptions to ontologies. These ontologies are used to define precisely each element used in the Description Scheme of MPEG-7. In order to allow similarities estimations and performing searches, the model is projected into a 5-dimensional space that permits to describe easily the content of multimedia documents.
A Revision of the Trapezoidal Branch-and-Bound Algorithm for Linear Sum-of-Ratios Problems
Authors: Takahito Kuno
Venue: Journal of Global Optimization (2005)

In this paper, we point out a theoretical flaw in Kuno [(2002)Journal of Global Optimization 22, 155---174] which deals with the linear sum-of-ratios problem, and show that the proposed branch-and-bound algorithm works correctly despite the flaw. We also note a relationship between a single ratio and the overestimator used in the bounding operation, and develop a procedure for tightening the upper bound on the optimal value. The procedure is not expensive, but the revised algorithms incorporating it improve significantly in efficiency. This is confirmed by numerical comparisons between the original and revised algorithms.
On the Power of Feature Analyzer for Signature Verification
Authors: Jalal Mahmud, Chowdhury Mofizur Rahman
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

This paper is concerned with verification of signatures using feature analysis and non linear classifier. Signatures are collected and scanned to obtain input image. Preprocessing involves removal of noise and making the input image size invariant. Feature analyzer can reduce the large domain of feature space and extract invariable information. Because of non linearity present in the input, a non linear classifier is used. Instead of using feed forward neural network, multiple feed forward neural networks are used which are trained in the form of ensemble. Using such ensemble makes the system more general than a regular single neural network based system. Resilient back propagation algorithm has been used for each neural network training to achieve faster recognition. Significant amount of training and testing has been performed using 10 fold cross validation and resultant impressive recognition accuracy (More than 90%) proves the effectiveness of the system.
Fast condensed nearest neighbor rule
Authors: Fabrizio Angiulli
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We present a novel algorithm for computing a training set consistent subset for the nearest neighbor decision rule. The algorithm, called FCNN rule, has some desirable properties. Indeed, it is order independent, and has subquadratic worst case time complexity, while it requires few iterations to converge, and it is likely to select points very close to the decision boundary. We compare the FCNN rule with state of the art competence preservation algorithms on large multidimensional training sets, showing that it outperforms existing methods in terms of learning speed and learning scaling behavior, and in terms of size of the model, while it guarantees a comparable prediction accuracy.
Transnational electronic systems and patent infringement
Authors: Richard Stern
Venue: IEEE Micro (2005)

The author discusses transnational electronic systems and patent infringement.
Recovering semantic relations from web pages based on visual cues
Authors: Peifeng Xiang, Yuanchun Shi
Venue: Proceedings of the 11th international conference on Intelligent user interfaces (2006)

Recovering semantic relations between different parts of web pages are of great importance for multi-platform web interface development, as they make it possible to re-distribute interaction objects and change the structure of interfaces while preserving the semantics of the UI. Important semantic relations include topic, order, hierarchy, etc. This paper presents a visual cues based approach, which is tag-tree structure independent, to automatically detect such kind of semantic relations in web pages. Comparing with other existing techniques, such as DOM-based methods, this approach mostly depends on interfaces' perceptible visual information that is more reliable. The preliminary evaluation on complex web sites shows promising results. We believe further exploration is worth taken.
Efficient and provably secure ciphers for storage device block level encryption
Authors: Yuliang Zheng, Yongge Wang
Venue: Proceedings of the 2005 ACM workshop on Storage security and survivability (2005)

Block ciphers generally have fixed and relatively small input length. Thus they are often used in some mode of operations (e.g., ECB, CBC, CFB, and CTR) that enables the encryption of longer messages. Unfortunately, all these modes of operation reveal some information on their inputs or on relationships between different inputs. As an example, in the CBC mode, encrypting two messages with an identical prefix will result in identical initial blocks in the ciphertexts. Due to the well-known birthday attack and the small input length, the CBC mode becomes less secure as the number of data blocks to be encrypted increases. This leads to a challenging task, namely to design schemes for storage device block or sector level data encryption that are efficient and do not have the disadvantages mentioned above. In this paper, we propose an efficient cipher whose data/cipher blocks can be specified flexibly to match the length of a block unit for current and foreseeable future storage devices. We show that our encryption scheme is provably secure under the assumption that the underlying one-way hash function is a random function.
Reprocessing DØ Data with SAMGrid
Authors: Frederic Villeneuve-Seguier
Venue: Proceedings of the First International Conference on e-Science and Grid Computing (2005)

The DØ experiment studies proton-antiproton collisions at the Tevatron collider based at Fermilab, Reprocessing, managing and distributing the large amount of real data coming from the detector as well as generating sufficient Monte Carlo data are some of the challenges faced by the DØ collaboration. SAMGrid combines the SAM datas handling system with the necessary job and information management allowing us to use the distributed computing resources in the various worldwide computing centers. This is one of the first large scale grid applications in High Energy Physics (in particular as we are using real data). After successful Monte Carlo production and a limited data reprocessing in the winter of 2003/04, the next milestone will be the reprocessing of the full current data set by this autumn/winter. It consists of ⁓500 TB of data, encompassing one billion events.
Impedance Matching Concepts in RFID Transponder Design
Authors: K. V. S. Rao, Pavel V. Nikitin, Sander F. Lam
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

In this paper, we analyze impedance matching concepts in passive radio frequency identification (RFID) transponders, which are powered by the incoming RF energy and consist of an antenna and an integrated circuit chip, both with complex impedances. The impedance match between the chip and the antenna can be characterized by the power transmission coefficient. We analyze the behavior of the power transmission coefficientand the effect it has on the tag performance. As an example, we consider a specific RFID transponder design, an Intellitag ID card with embedded folded meander antenna operating in 915 MHz band. We present both measurement data and simulation results, which are in good agreement.
On Blocking Probability of Multi-Beam CDMA Systems Using SBF Array Antennas
Authors: Hyunduk Kang, Seokjin Sung, Insoo Koo, Kiseon Kim
Venue: Wireless Personal Communications: An International Journal (2005)

In wireless cellular systems, a code division multiple access (CDMA) technology with array antennas can significantly reduce interferences by taking advantage of the combination of spreading spectrum and spatial filtering. We investigate blocking probabilities of multi-beam CDMA systems using switched beamforming (SBF) array antennas considering non-homogeneous traffic loading over a cell which may cause traffic congestion and introduce large blocking probability in a hot-spot area. We also propose a feasible main beamwidth deployment and a beam reassignment (BR) method to mitigate the hot-spot beam, named the hot-beam. The feasible main beamwidth deployment suggests that we can relieve the hot-beam situation by deploying the feasible main beamwidth which can guarantee below 1% blocking probability. Using the BR method, the blocking probability of hot-beam and total blocking probability over a cell are significantly reduced. Further, it is shown that the feasible traffic load ratio of the hot-beam to the lightly loaded beam is significantly enhanced when the total blocking probability of the cell is maintained below 1%.
Computer simulation: a teaching tool in hotel management
Authors: Elizabeth M. Upton, Anil Sheth
Venue: ACM SIGSIM Simulation Digest (1976)

A computerized hotel simulation was developed for use by a senior class of undergraduates in a hospitality management program. The simulation is an integral part of a course entitled Computer Applications in Hotels and Restaurants. The objectives of the hotel simulation, in addition to illustrating the dynamics of hotel operation and procedural control, were to provide managerial experience in accounting, problem-solving and decision-making. Sub-systems relating to front office procedures and back office accounting are currently available in the model. Interactive terminal operation, shared file concepts and APL PLUS on a time-sharing basis are employed. The simulation has been used as a teaching tool in variety of ways as the size of the class has increased from 26 to 68 during the four years of simulation development. The actual computing cost per student of approximately $30.00, is low considering that the experience gained by using the simulation cannot be duplicated in any other way. Evaluation both by faculty and students has shown that the simulation did allow the application of theory and background knowledge to a model which closely resembled a real life situation. As a result the students were encouraged to solve problems and make decisions in a way that permitted a better understanding of the role of management in the real world. The type of education gained in such a computer applications course will develop user-managers who have the expertise to participate effectively in the development and use of management information systems. The simulation could also be used in special research projects; the concepts of the back office module could have wide application in other areas of business management. 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
Learning class-discriminative dynamic Bayesian networks
Authors: John Burge, Terran Lane
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

In many domains, a Bayesian network's topological structure is not known a priori and must be inferred from data. This requires a scoring function to measure how well a proposed network topology describes a set of data. Many commonly used scores such as BD, BDE, BDEU, etc., are not well suited for class discrimination. Instead, scores such as the class-conditional likelihood (CCL) should be employed. Unfortunately, CCL does not decompose and its application to large domains is not feasible. We introduce a decomposable score, approximate conditional likelihood (ACL) that is capable of identifying class discriminative structures. We show that dynamic Bayesian networks (DBNs) trained with ACL have classification efficacies competitive to those trained with CCL on a set of simulated data experiments. We also show that ACL-trained DBNs outperform BDE-trained DBNs, Gaussian na&iuml;ve Bayes networks and support vector machines within a neuroscience domain too large for CCL.
Voice Capacity Analysis of WLAN with Unbalanced Traffic
Authors: Lin Cai, Xuemin (Sherman) Shen, Jon W. Mark, Yang Xiao
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

We evaluate the performance of voice transmission over a single-AP WLAN analytically and via simulation. Given the parameters of the Medium Access Control protocol and different voice codecs, the voice capacity of the WLAN, in terms of the maximum number of voice connections that can be supported by the WLAN with satisfactory userperceived quality, is obtained. Our analysis is applicable for unsaturated-station scenarios, and considers the practical issue induced by the unbalanced traffic. Extensive simulations have been performed to validate the analytical results.
In Brief: IPv6 and Distributed Applications
Authors: David Geer
Venue: IEEE Distributed Systems Online (2005)

The next-generation Internet protocol, IPv6, is inching its way toward adoption. Asian countries are moving fastest, at least partly because of their great need for IPv6's expanded address space, but efforts in the US and Europe also signal growth.
Certain Problems of Asymptotic Analysis and Extensions. I
Authors: A. G. Chentsov
Venue: Automation and Remote Control (2005)

Asymptotic attainability interpreted as the approximate realization of desirable states under weak slackening of constraints is studied. Constructs ensuring the realization of asymptotically attainable states in terms of standard constraints on the choice of generalized elements and interpreted as finitely additive measures on a suitable measurable space are designed. Special attention is paid to "Boolean-valued" realizations of generalized problems (extensions) in the class of (0, 1)-measures or ultrafilters of measurable spaces and are interpreted as direct extension constructs (in the sense of transitions from exact solutions to approximate solutions).
Power Saving Access Points for IEEE 802.11 Wireless Network Infrastructure
Authors: Feng Zhang Terence D. Todd, Dongmei Zhao
Venue: IEEE Transactions on Mobile Computing (2006)

In the past decade, there has been a huge proliferation of wireless local area networks (WLANs) based on the IEEE 802.11 WLAN standard. As 802.11 connectivity becomes more ubiquitous, multihop communications will be increasingly used for access point range extension and coverage enhancement. In this paper, we present a design for an IEEE 802.11-based power saving access point (PSAP), intended for use in multihop battery and solar/battery powered applications. These types of APs have many practical applications and can be deployed very quickly and inexpensively to provide coverage enhancement in situations such as campuses, building complexes, and fast deployment scenarios. Unlike conventional wired access points, in this type of system, power saving on the AP itself is an important objective. A key design constraint is that the proposed PSAP be backward compatible to a wide range of IEEE 802.11 functionality and existing wired access points. In this paper, we introduce the protocols required to achieve this compatibility, show the constraints imposed by this restriction, and present performance results for the proposed system.