ppxscal/embedding_network huggingface dataset:
An Evaluation of Vertical Class Partitioning for Query Processing in Object-Oriented Databases
Authors: Chi-wai Fung, Kamalakar Karlapalem, Qing Li
Venue: IEEE Transactions on Knowledge and Data Engineering (2002)

Vertical partitioning is a design technique for reducing the number of disk accesses to execute a given set of queries by minimizing the number of irrelevant instance variables accessed. This is accomplished by grouping the frequently accessed instance variables as vertical class fragments. The complexity of object-oriented database models due to subclass hierarchy and class composition hierarchy complicates the definition and representation of vertical partitioning of the classes, which makes the problem of vertical partitioning in OODBs very challenging. In this paper, we develop a comprehensive analytical cost model for processing of queries on vertically partitioned OODB classes. A set of analytical evaluation results is presented to show the effect of vertical partitioning, and to study the trade-off between the projection ratio versus selectivity factor vis-a-vis sequential versus index access. Furthermore, an empirical experimental prototype supporting vertical class partitioning has been implemented on a commercial OODB tool kit to validate our analytical cost model.
Response Time Analysis of EQL Real-Time Rule-Based Systems
Authors: Jeng-Rung Chen, Albert Mo Kim Cheng
Venue: IEEE Transactions on Knowledge and Data Engineering (1995)

Real-time rule-based expert systems are embedded decision systems that must respond to changes in the environments within stringent timing constraints. Given a program p, the response time analysis problem is to determine the response time of p. This problem consists of 1) determining whether or not the execution of p always terminates in bounded time, and 2) computing the maximal execution time of p.The EQuational Logic (EQL) language is a simple language designed for real-time applications. It has been proved by Mok that the response time analysis problem is undecidable if the program variables have infinite domains, and is PSPACE-hard in the case where all of the variables have finite domains. However, we have observed that the use of a simple syntactic and semantic check on programs coupled with other techniques such as state space graph checks can dramatically reduce the time needed in the analysis. There are sets of syntactic and semantic constraint assertions such that if the set S of rules satisfies any of them, then the execution of S always terminates in bounded time. Each of these sets of syntactic and semantic constraint assertions is called a Special Form.The focus of this paper is on proving the existence of two Special Forms and determining tight response time upper bounds of EQL rule-based programs. For each known Special Form, an algorithm used to calculate the maximal response time of programs satisfying this Special Form is presented. Additionally, to enhance the applicability of the proposed algorithms, we show how the General Analysis Algorithm can be used with these algorithms.
Assessing aspects of children's written grammar: automating the process
Authors: C. E. Holdich, R. G. Holdich, P. W. H. Chung
Venue: Computers Education (2002)

Teachers are expected to make regular assessments of pupils' writing, providing feedback about their strengths and weaknesses. If the computer could assist teachers in this task by effectively analysing the grammar element in children's writing, then the teacher's work load would be significantly reduced. A computer generated 'text analysis' of grammatical features would have the benefit of providing diagnostic information systematically and efficiently. Although text analysis is not new, it is generally restricted to applications aimed at adults. The development of a quantitative text analysis program, specifically geared to analysing children's writing was therefore considered profitable. This required an understanding of both the development of children's writing abilities and the criteria of the National Curriculum levels of attainment for the Standard Assessment Tasks (SATs). Ten grammar features were selected for analysis. Stories reflecting the spread of attainment associated with the end of Key Stage 2 were analysed. The computer successfully distinguished positive and negative grammar features within these texts. Nevertheless, an assessment of qualitative genre details made by teachers will still be required, in order to provide a balanced assessment which includes all elements that contribute to effective writing.
Survivable Information Storage Systems
Authors: Jay J. Wylie, Michael W. Bigrigg, John D. Strunk, Gregory R. Ganger, Han Kiliççöte, Pradeep K. Khosla
Venue: Computer (2000)

As society increasingly relies on digitally stored and accessed information, supporting the availability, integrity, and confidentiality of this information is crucial. Systems need to help users securely store critical information, ensuring that it persists, is continuously accessible, cannot be destroyed, and is kept confidential. The authors show why they believe a survivable storage system would provide these guarantees, despite malicious compromises of storage node subsets.This article describes the PASIS architecture, which combines decentralized storage system technologies, data redundancy and encoding, and dynamic self-maintenance to create survivable information storage.The authors explain how the PASIS architecture flexibly and efficiently combines technologies for constructing in-formation storage systems whose availability, confidentiality, and integrity policies can survive component failures and malicious attacks.
A simple algorithm for surface denoising
Authors: Jianbo Peng, Vasily Strela, Denis Zorin
Venue: Proceedings of the conference on Visualization '01 (2001)

We present a simple denoising technique for geometric data represented as a semiregular mesh, based on locally adaptive Wiener filtering. The degree of denoising is controlled by a single parameter (an estimate of the relative noise level) and the time required for denoising is independent of the magnitude of the estimate. The performance of the algorihm is sufficiently fast to allow interactive local denoising.
A note on degree conditions for Hamiltonicity in 2-connected claw-free graphs
Authors: Ondrej Kovárík, Milos Mulac, Zdenek Ryjácek
Venue: Discrete Mathematics (2002)

Let G be a claw-free graph and let cl(G) be the closure of G. We present a method for characterizing classes Gi, i = 3,..., 7, of 2-connected closed claw-free graphs with the following properties. (i) Theorem. Let G be a 2-connected claw-free graph of order n ≥ 153 such that δ(G) ≥ 20 and σ8(G) > n + 39. Then either G is hamiltonian or cl (G) ∈ ∪i=37 Gi. (ii) Corollary. Let G be a 2-connected claw-free graph of order n ≥ 153 with δ(G) ≥ (n + 39)/8. Then either G is hamiltonian or cl (G) ∈ ∪i=37 Gi.The family of exceptions contains 318 infinite classes. The majority of these exception classes were found with the help of a computer.
Associative Neural Network
Authors: Igor V. Tetko
Venue: Neural Processing Letters (2002)

An associative neural network (ASNN) is a combination of an ensemble of the feed-forward neural networks and the K-nearest neighbor technique. The introduced network uses correlation between ensemble responses as a measure of distance among the analyzed cases for the nearest neighbor technique and provides an improved prediction by the bias correction of the neural network ensemble both for function approximation and classification. Actually, the proposed method corrects a bias of a global model for a considered data case by analyzing the biases of its nearest neighbors determined in the space of calculated models. An associative neural network has a memory that can coincide with the training set. If new data become available the network can provide a reasonable approximation of such data without a need to retrain the neural network ensemble. Applications of ASNN for prediction of lipophilicity of chemical compounds and classification of UCI letter and satellite data set are presented. The developed algorithm is available on-line at http://www.virtuallaboratory.org/lab/asnn.
A 3D Skewing and De-skewing Scheme for Conflict-Free Access to Rays in Volume Rendering
Authors: Arie Kaufman, Daniel Cohen-Or
Venue: IEEE Transactions on Computers (1995)

We extend a 2D linear skewed memory organization to 3D and introduce the associated de-skewing scheme designed to provide conflict-free access to projection rays of voxels for use in a volume rendering architecture. This is an application of a 3D linear skewing scheme which supports real-time axonometric projection from 26 primary orientations.
Structure and Motion from Line Segments in Multiple Images
Authors: Camillo J. Taylor, David J. Kriegman
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

This paper presents a new method for recovering the three dimensional structure of a scene composed of straight line segments using the image data obtained from a moving camera. The recovery algorithm is formulated in terms of an objective function which measures the total squared distance in the image plane between the observed edge segments and the projections (perspective) of the reconstructed lines. This objective function is minimized with respect to the line parameters and the camera positions to obtain an estimate for the structure of the scene. The effectiveness of this approach is demonstrated quantitatively through extensive simulations and qualitatively with actual image sequences. The implementation is being made publicly available.
1995 Annual Index
Venue: IEEE Software (1995)

This index is divided into two sections ¿ a subject index and an author index, both arranged alphabetically ¿ covering material that appeared in IEEE Software in 1995 (Vol. 12, Nos. 1-6). Coauthors are listed only in the author index; ¿et al.¿ marks articles in the subject index that have coauthors. This index is available electronically at http://www.computer.org 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
Interactive Analysis of Computer Crimes
Authors: Donald E. Brown, Louise E. Gunderson, Marc H. Evans
Venue: Computer (2000)

Police departments and other law enforcement agencies continually analyze vast amounts of criminal incident data to better understand crime in their jurisdictions, to identify significant changes in crime levels, to plan community and neighborhood responses to crime, to investigate incidents, and to apprehend perpetrators. Law enforcement agencies are increasingly turning to automated tools to examine multiple incident reports and analyze criminal activities in their areas based on geographical location, time, and type.This article presents a system developed at the University of Virginia that adapts computerized techniques created for analyzing conventional crimes for use by law enforcement agencies in the Internet age.This computer crime analysis system builds directly on systems researched and built for conventional crime analysis over large regions. In addition to linking criminal activities by location, time, and method, this system can detect significant changes in criminal activity and discover criminal preferences to aid in predicting future threats.
Trunking of TDM and narrowband services over IP Networks
Authors: James Aweya
Venue: International Journal of Network Management (2003)

The recent interest in IP as the vehicle for transporting TDM and narrowband services stems from the possibility of using a common transport network for voice, video, and data, and the flexibility with which new services can be introduced. A key step in the evolution of networks towards a &lsquo;broadband&rsquo; IP-based environment is the &lsquo;graceful&rsquo; interworking of the IP networks with the existing networks and services, particularly with the circuit switched telephone network. A &lsquo;graceful&rsquo; interworking approach is one whose complexity is minimal and preserves the user's perceived quality of service (QoS). To interwork with a circuit switched network whose services are pre-dominantly time-sensitive, the IP network must essentially behave as a transparent &lsquo;link&rsquo; in the end-to-end connection. This paper presents an overview of the main technical problems to be addressed when trunking TDM and narrowband services over IP networks.
Kaleidoscope: A Cooperative Menu-Guided Query Interface (SQL Version)
Authors: S. K. Cha
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

Kaleidoscope's approach is presented in the context of seeking improvement in the usability of interactive structured query language (SQL) interfaces. The system's cooperation is summarized as proposing valid query constituents step-by-step and providing lexical and semantic feedback immediately to users. To implement this intraquery guidance, the context-free grammar (CFG) is extended to capture the constraints useful for intraquery guidance, and the knowledge useful for pruning nonsensical queries and providing semantic feedback is articulated. For the SQL interface, this knowledge includes a strong domain concept, functional dependency, and integrity constraint rules, which can be acquired once in the database design step. The same types of knowledge are useful both for postquery cooperation and intraquery guidance. As SQL is supported bv virtually all database management system (DBMS) vendors, the approach presents a practical solution for casual database access.
On linear blocking sets in PG (2, q t)
Authors: Pompeo Polito, Olga Polverino
Venue: Discrete Mathematics (2002)

In this paper we characterize the GF(q)-linear blocking sets in PG(2, qt) of maximal size and we construct two new families of small minimal blocking sets not of Rédei type.
Control Versus Data Flow in Parallel Database Machines
Authors: W. B. Teeuw, H. M. Blanken
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

The execution of a query in a parallel database machine can be controlled in either acontrol flow way, or in a data flow way. In the former case a single system node controlsthe entire query execution. In the latter case the processes that execute the query,although possibly running on different nodes of the system, trigger each other. Lately,many database research projects focus on data flow control since it should enhanceresponse times and throughput. The authors study control versus data flow with regardto controlling the execution of database queries. An analytical model is used to comparecontrol and data flow in order to gain insights into the question which mechanism isbetter under which circumstances. Also, some systems using data flow techniques aredescribed, and the authors investigate to which degree they are really data flow. Theresults show that for particular types of queries data flow is very attractive, since it reduces the number of control messages and balances these messages over the nodes.
Electron microscopic investigation of MnSi1.7 layers on Si(001)
Authors: A. Mogilatenko, M. Falke, S. Teichert, S. Schwendler, D. K. Sarkar, H.-J. Hinneberg
Venue: Microelectronic Engineering (2002)

Semiconducting higher manganese silicides (HMS) with a composition near that of MnSi1.7 are of special interest due to their thermoelectric properties. We report on the growth of HMS layers deposited by MBE using the template technique. In particular the influence of the template thickness on the structure and morphology of MnSi1.7 films on (001)Si substrates was investigated. It was found that there is an optimal template thickness that causes preferred epitaxial growth of the major amount of the silicide. Three different epitaxial orientation relations of the silicide crystals to the substrate were observed. Considering the specific features of the electron diffraction patterns of MnSi1.7 the HMS phase was identified as Mn4Si7.
Selecting "best" MPP: do benchmarks really tell the whole story?
Authors: Myron Ginsberg
Venue: Proceedings of the 1994 ACM/IEEE conference on Supercomputing (1994)

The proliferation of MPP's has made it very difficult for users to accurately assess which machine is "best" for a specific user application. Simply testing one or more kernels on a new machine is insufficient since slight program modifications can produce large variations in performance and thus could lead users to erroneous conclusions about the performance of the entire application. Most industrial applications are far too large to be easily or quickly benchmarked. Although there are many benchmark suites, can performance with any of those accurately predict performance for a specific industrial application? This is the dilemma potential MPP users face. The panel members have had extensive benchmarking experience. Topics to be discussed include: assessing MPP performance for scientific, engineering, and/or commercial data processing applications (including database and transactions processing); limitations of existing benchmark suites and performance metrics; guidelines to assess MPP performance. 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
Speculative Multithreaded Processors
Authors: Gurindar S. Sohi, Amir Roth
Venue: Computer (2001)

Although novel functionality in the 1990s played a dominant role in processor design, the authors predict that implementation will dominate over functionality. Designing, debugging, and verifying monolithic designs that use hundreds of millions of transistors will be very difficult, and increasing wire delays will make intrachip communication and clock distribution costly. Consequently, some computer architects advocate shifting from high-performance to high-throughput processing, using distributed components to conquer design-process complexity and exploit communication locality to solve wire delays. Multithreaded architectures can extract parallelism from a sequential program via thread-level speculation, making it flexible to operate in multiple-program, high-throughput and single-program, high-performance environments. Speculation is the key factor. Multithreaded processors that support concurrent execution of multiple threads on a single chip may dominate some application uses in the next decade. Simultaneous multithreading uses monolithic designs with shared resources among the threads. Multithreading seeks to divide programs into data-independent parallel threads. Before speculative multithreading becomes commonplace in mainstream processors, technologies must be developed for conveying thread information from software to hardware. Likewise, algorithms for thread selection and management and hardware and software to support the simultaneous execution of speculative and nonspeculative threads must also be devised.
Gabriel: A Design Environment for DSP
Authors: J. C. Bier, E. E. Goei, W. H. Ho, P. D. Lapsley, M. P. O'Reilly, G. C. Sih, E. A. Lee
Venue: IEEE Micro (1990)

Gabriel, a second-generation digital signal-processing (DSP) design environment, is described. The Gabriel experimental signal-processing software performs non-real-time algorithm simulations and code synthesis for real-time hardware based on programmable DSPs. Gabriel eases code development for architectures that are not easy targets for conventional compilers. The model of compilation used by Gabriel is discussed at length. Modification of the model to run in real time, target architectures, and scheduling are examined.
Fast Evolutionary Learning with Batch-Type Self-Organizing Maps
Authors: Teuvo Kohonen
Venue: Neural Processing Letters (1999)

Although no distance function over the input data is definable, it is still possible to implement the self-organizing map (SOM) process using evolutionary-learning operations. The process can be made to converge more rapidly when the probabilistic trials of conventional evolutionary learning are replaced by averaging using the so-called Batch Map version of the self-organizing map. Although no other condition or metric than a fitness function between the input samples and the models is assumed, an order in the map that complies with the &rsquo;functional similarity&lsquo; of the models can be seen to emerge. There exist two modes of use of this new principle: representation of nonmetric input data distributions by models that may have variable structures, and fast generation of evolutionary cycles that resemble those defined by the genetic algorithms. The spatial order in the array of models can be utilized for finding more uniform variations, such as crossings between functionally similar models.
A Note On Type Checking Linear Functional Languages
Authors: Apostolos Syropoulos
Venue: ACM SIGPLAN Notices (1996)

A linear functional language is based on a linear lambda;-calculus. Any linear functional program must observe linearity and it has to be type correct. Type correctness can be ensured by means of a type-checking system. A type checker for a linear functional language is essentially a type-checker for an ordinary functional language, modified to properly handle the modality ofcourse.
The Wireless Internet: Promises and Challenges
Authors: David J. Goodman
Venue: Computer (2000)

In the 1980s, the PC migrated from the hobbyist's den to the corporate desktop, a huge development in information technology. Ten years later, that honor fell to the Internet and wireless telephones, which until now have followed separate paths. The author predicts that this decade will see the convergence of wireless communications and the Internet. Although the commercial impact of wireless communications has thus far been limited to cellular telephones, the business and technical communities anticipate rapid growth in wireless data services. Almost daily, some prominent company announces plans for a "wireless e-commerce" enhancement to its business. The author examines the outlook for wireless data. Specifically, he considers the utility of wireless data services and why they have not been widely adopted until now. He also looks at the technology trends promoting wireless Internet convergence, and the obstacles preventing their implementation.As computing becomes increasingly mobile, the limitations of third-generation cellular telephony and the wireless applications protocol become increasingly apparent. The author asserts that only a new approach can make the Internet truly wireless.
Simplifying distributed database systems design by using a broadcast network
Authors: Jo-Mei Chang
Venue: Proceedings of the 1984 ACM SIGMOD international conference on Management of data (1984)

Atomic broadcast and failure detection are powerful primitives for distributed database systems In the distributed database system LAMBDA, they are provided as network primitives In this paper, we show how atomic broadcast and failure detection simplify transaction commitment, concurrency control, and crash recovery Specifically, we give a simple two-phase non-blocking commit protocol, whereas three phases are required in a point-to-point network We also give a simplified read-one/write-all update algorithm for replicated data and an easily implemented log-based recovery algorithm providing uninterrupted transaction processingThe benefits of performing the atomic broadcast and failure detection at the network level are also discussed Performing these functions at the network level not only simplifies database protocols but also better utilizes the broadcast network fewer messages are transmitted Comparisons between LAMBDA and existing distributed database systems are also made