ppxscal/embedding_network huggingface dataset:
Feature analysis of selected database recovery techniques
Authors: Bharat Bhargava, Leszek Lilien
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

Database recovery techniques in a real-time environment for so called single-division databases are investigated. A classification of database recovery goals and a classification of database system crashes is presented. It is shown that the (best) recovery goal is a function of a crash category against which the system is to be protected. In particular, for the broadest category of hidden hard crashes an actual past state is an attainable recovery goal. It is described how to reach this goal using a generic recovery technique, based on an idea of a database recovery block. The specific recovery techniques implementing the generic technique are described. Then the representation of each specific recovery technique in terms of atomic "primitives" is demonstrated. The claim is made that this "divide-and-conquer" approach can facilitate the analysis of the database recovery techniques.
Asynchronous Participatory Exams: Internet Innovation for Engaging Students
Authors: Dezhi Wu, Michael Bieber, Starr Roxanne Hiltz
Venue: IEEE Internet Computing (2009)

The Asynchronous Learning Networks Participatory Examination (APE) is a constructivist approach that fully engages students in the entire exam life cycle. Students design and solve exam questions while evaluating their peers' solutions using an anonymous, structured process enabled by Internet technologies. APE achieves higher-level learning by encouraging students to tap into all levels of cognitive skills. Compared to the traditional exam experiences in most classes, most students prefer APE, enjoy its process, and recommend its use. APE liberates both students and instructors by reengineering the examination process and deepening learning throughout.
The Claremont report on database research
Authors: Rakesh Agrawal, Anastasia Ailamaki, Philip A. Bernstein, Eric A. Brewer, Michael J. Carey, Surajit Chaudhuri, Anhai Doan, Daniela Florescu, Michael J. Franklin, Hector Garcia-Molina, Johannes Gehrke, Le Gruenwald, Laura M. Haas, Alon Y. Halevy, Joseph M. Hellerstein, Yannis E. Ioannidis, Hank F. Korth, Donald Kossmann, Samuel Madden, Roger Magoulas, Beng Chin Ooi, Tim O'Reilly, Raghu Ramakrishnan, Sunita Sarawagi, Michael Stonebraker, Alexander S. Szalay, Gerhard Weikum
Venue: Communications of the ACM (2009)

Database research is expanding, with major efforts in system architecture, new languages, cloud services, mobile and virtual worlds, and interplay between structure and text.
Real Time Scalable Video Communication Demonstration at ICMCS-99
Authors: Ivano Barbieri, Marco Raggio
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

This document describes the demonstration of the Scaleable Video Communication Unit (VCU) at ICMCS-99 in Florence. The demonstration simulates two different field-applications: Distance Learning (DL) and Forest Surveillance (FS). The VCU is based on a scalable H263+ video codec integrated in a H324, multimedia terminal used as a common core for the two applications addressed in the SCALAR field tests.
Linguistic recognition system for identification of some possible genes mediating the development of lung adenocarcinoma
Authors: Rajat K. De, Anupam Ghosh
Venue: Information Fusion (2009)

In the present article, we develop a linguistic recognition system for identification of some possible genes mediating the development of human lung adenocarcinoma. The methodology involves dimensionality reduction, classifying the genes through incorporation of the notion of linguistic fuzzy sets low, medium and high, and finally selection of some possible genes obtained by a rule generation/grouping technique. The system has been successfully applied on two microarray gene expression data sets. The results are appropriately validated by some earlier investigations, gene expression profiles and t-test. The proposed methodology has been able to find more true positives than an existing one in identifying responsible genes. Moreover, we have found some new genes that may have role in mediating the development of lung adenocarcinoma.
An Improved K-Means Clustering Algorithm Based on Spectral Method
Authors: Shengwen Tian, Hongyong Yang, Yilei Wang, Ali Li
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

It is well known that K-means algorithm is very sensitive to outliers, and often terminates at a local optimum. Furthermore, it is necessary for K-means algorithm to determine the number K of clusters as a priori knowledge in advance. Therefore, the quality of the result is not satisfactory. In this paper, we develop an improved K-means clustering algorithm--NK-means. NK-means is based on spectral methods, namely uses Normal matrix that is used in spectral analysis approaches to normalize original datasets, and then finds clusters in the processed datasets by K-means algorithm. We also propose a measure for the strength of clusters structure found by NK-means algorithm, which gives us an objective metric for choosing the number K of clusters into which a data set should be divided. Experiment shows that NK-means algorithm significantly outperforms K-means in the efficiency and accuracy.
A hybrid multi-order fuzzy time series for forecasting stock markets
Authors: Hia Jong Teoh, Tai-Liang Chen, Ching-Hsue Cheng, Hsing-Hui Chu
Venue: Expert Systems with Applications: An International Journal (2009)

This paper proposes a hybrid model based on multi-order fuzzy time series, which employs rough sets theory to mine fuzzy logical relationship from time series and an adaptive expectation model to adjust forecasting results, to improve forecasting accuracy. Two empirical stock markets (TAIEX and NASDAQ) are used as empirical databases to verify the forecasting performance of the proposed model, and two other methodologies, proposed earlier by Chen and Yu, are employed as comparison models. Besides, to compare with conventional statistic method, the partial autocorrelation function and autoregressive models are utilized to estimate the time lags periods within the databases. Based on comparison results, the proposed model can effectively improve the forecasting performance and outperforms the listing models. From the empirical study, the conventional statistic method and the proposed model both have revealed that the estimated time lags for the two empirical databases are one lagged period.
Analog placement with common centroid and 1-D symmetry constraints
Authors: Linfu Xiao, Evangeline F. Y. Young
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

In this paper, we will present a placement method for analog circuits. We consider both common centroid and 1-D symmetry constraints, which are the two most common types of placement requirements in analog designs. The approach is based on a symmetric feasible condition on the sequence pair representation that can cover completely the set of all placements satisfying the common centroid and 1-D symmetry constraints. This condition is essential for a good searching process to solve the problem effectively. Symmetric placement is an important step to achieve matchings of other electrical properties like delay and temperature variation. We have compared our results with those presented in the most updated previous works. Significant improvements can be obtained by our approach in both common centroid and 1-D symmetry placements, and we are the first who can handle both constraints simultaneously.
Designing Rainwater Harvesting Systems for Large-Scale Potable Water Saving Using Spatial Information System
Authors: Yie-Ru Chiu, Chao-Hsien Liaw
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

Rainwater harvesting systems (RWHSs) are promoted by many governments to enhance the availability of water resources and reduce the consumption of potable water. However, the traditional evaluation of RWHSs neglects the spatial-temporal complexity of rainfall and therefore can not be applied for a large-scale design. This study established a water saving information system (WSIS) incorporating hydraulic simulation, spatial interpolation, economic analysis and options selection, and use Taipei City as a case study. Two RWHS designs and low-flow toilets were tested through WSIS to visualize the spatial variance of the economic feasibility and to seek the optimum water-saving design. Sensitivity analysis also verifies that WSIS renders higher information value than the traditional generalized method. Hence, as a practical tool, this WSIS is useful for large-scale potable water-saving design to ease the water shortage problems.
An information theory based complexity measure
Authors: Eli Berlinger
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

There have been numerous measures proposed to measure program complexity. Some are completely heuristic, comparing certain measurable program features against a set of predefined standards. Some are topological, based on the number of regions on the control or data graph of the programs or a combination of the above, and of course, there is Halstead's Software Physics.
A classification of compression methods and their usefulness for a large data processing center
Authors: Doron Gottlieb, Steven A. Hagerth, Philippe G. H. Lehot, Henry S. Rabinowitz
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

The compression techniques surveyed in this paper all work to reduce storage space for data files at the price of increased CPU activity needed for compression and decompression. As CPU time becomes cheaper relative to the cost of external storage devices, compression appears as an increasingly attractive option for dealing with large files.
Closed-loop modeling of power and temperature profiles of FPGAs
Authors: Kanupriya Gulati, Sunil P. Khatri, Peng Li
Venue: Proceeding of the ACM/SIGDA international symposium on Field programmable gate arrays (2009)

In recent times, the contribution of leakage power to the total power consumption of a chip has been increasing at an alarming rate. Leakage power is expected to exceed dynamic power in newer process technologies. Since leakage exhibits an exponential increase with temperature, it is possible that the high leakage of an IC causes a temperature increase, which in turn causes an increase in leakage, and so on, until the IC fails due to overheating. At the very least, this may cause the temperature and power consumption of the IC to be poorly estimated by traditional thermal or power modeling techniques. We developed a framework to model this situation in an FPGA context. Our CAD framework accurately models the total power consumption of the design at a given temperature, finds the thermal profile of the IC under this power consumption, and then uses this new thermal information to update the power consumption. This is iterated until the temperature of the IC converges, or until the temperatures on the die exceed a safe value. The iterations are very fast, due to the use of accurate and compact mathematical macromodels for leakage and temperature computation in the inner loop. We have exhaustively verified the fidelity of all our leakage macromodels. They estimate the leakage, at any temperature, to within 3% of the values generated by SPICE, while providing greater than four orders of magnitude speedup over explicit SPICE runs. Our experiments show that this model helps avoid an incorrect estimation of chip temperature and total power consumption, and also helps detect the increase in device temperature beyond a safe value. The average (maximum) error of our temperature estimates has been found to be within 1% (2.5%) compared to a full-chip 3D temperature modeling tool.
Statistically appraising process quality of affinity isolation experiments
Authors: Julia L. Sharp, John J. Borkowski, Denise Schmoyer, Don S. Daly, Samuel Purvine, William R. Cannon, Gregory B. Hurst
Venue: Computational Statistics Data Analysis (2009)

Quality affinity isolation experiments are necessary to identify valid protein-protein interactions. Biological error, processing error, and random variability can reduce the quality of an experiment, and thus hinder the identification of protein interaction pairs. Appraising affinity isolation assay quality is essential to inferring protein associations. An important step of the assay is the mass spectrometric identification of proteins. To evaluate this step, a known mixture of proteins is processed through a mass spectrometer as a quality control mixture. If the mass spectrometer yields unexpected results, the process is currently qualitatively evaluated, tuned, and reset. Statistical quality control (SQC) procedures, including the use of cumulative sum, the individual measurement, and moving range charts are implemented to analyze the stability of the mass spectrometric analysis. The SQC measures presented can assist in establishing preliminary control limits to identify an out-of-control process and investigate assignable causes for shifts in the process mean in real time.
Fast and Memory Efficient Mining of High Utility Itemsets in Data Streams
Authors: Hua-Fu Li, Hsin-Yun Huang, Yi-Cheng Chen, Yu-Jiun Liu, Suh-Yin Lee
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Efficient mining of high utility itemsets has become one of the most interesting data mining tasks with broad applications. In this paper, we proposed two efficient one-pass algorithms, MHUI-BIT and MHUI-TID, for mining high utility itemsets from data streams within a transaction-sensitive sliding window. Two effective representations of item information and an extended lexicographical tree-based summary data structure are developed to improve the efficiency of mining high utility itemsets. Experimental results show that the proposed algorithms outperform than the existing algorithms for mining high utility itemsets from data streams.
Research on the Data Storage and Access Model in Distributed Environment
Authors: Wuling Ren, Pan Zhou
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

In order to improve the data access efficiency and enhance the security in IT systems, a layered access control model with classified distributed storage in distributed environment is presented[1,2]. In the model, information is stored in numbers of physical distributed storage nodes. The storage architecture is logically organized into four classes, which includes active data storage, static data storage, backup data storage and data warehouse. Data access efficiency is increased because most applications will concentrate on active data storage or static data storage where the most recently and frequently used data are stored. Data security access is controlled through a 3-layered access control model based on RBAC model[3,4]. The three layers include operation layer, data logic security shield layer and application layer. Operation layer and application layer are to control the authorized access for system managers and application end users respectively. The data logic security shield layer is to shield the difference among the database safety control organizations. It is appreciated after the model has been applied to Zhejiang Fuchunjiang Limited Company.
Performance analysis of a threshold based distributed channel allocation algorithm for cellular networks
Authors: Tamer Tulgar, Muhammed Salamah
Venue: Computers and Electrical Engineering (2009)

Rapid advances of the handheld devices and the emergence of the demanding wireless applications require the cellular networks to support the demanding user needs more effectively. The cellular networks are expected to provide these services under a limited bandwidth. Efficient management of the wireless channels by effective channel allocation algorithms is crucial for the performance of any cellular system. To provide a better channel usage performance, dynamic channel allocation schemes have been proposed. Among these schemes, distributed dynamic channel allocation approaches showed good performance results. The two important issues that must be carefully addressed in such algorithms are the efficient co-channel interference avoidance and messaging overhead reduction. In this paper, we focus on our new distributed channel allocation algorithm and evaluate its performance through extensive simulation studies. The performance evaluation results obtained under different traffic load and user mobility conditions, show that the proposed algorithm outperforms other algorithms recently proposed in the literature.
Correlation between Mutations and Self-adaptation in Evolutionary Programming
Authors: Yong Liu
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

It has been taken for granted that long jumps of Cauchy mutation in a fast evolutionary programming (FEP) increase the probability of finding a near-optimum when the distance between the current search point and the optimum is large, but decrease the probability when such distance is small [1]. By explicitly measuring the search step sizes, this paper gives sound evidence that not long jumps but large variances in Cauchy mutation have contributed to the better performance of FEP than that of classical evolutionary programming (CEP). It has been discovered that smaller step-size mutations among Cauchy mutations had led to the faster convergence of FEP in some test functions, while these helpful Cauchy mutations could actually have shorter search step sizes than Gaussian mutations used in CEP. The reason that Cauchy mutations could have shorter step sizes than Gaussian mutations is that Cauchy mutations and Gaussian mutations could radically alter self-adaptation in FEP and CEP. This paper further discusses the correlation between mutations and self-adaptation in CEP and FEP.
Cacheable Decentralized Groups for Grid Resource Access Control
Authors: Jeffrey Hemmes, Douglas Thain
Venue: Proceedings of the 7th IEEE/ACM International Conference on Grid Computing (2006)

Sharing data among collaborators in widely distributed systems remains a challenge due to limitations with existing methods for defining groups across administrative domain boundaries with various file systems. Groups in traditional systems are bound to particular domains or file systems using centralized storage locations either beyond ordinary users' ability to manage, inaccessible outside a closed system, or both. We present a method for users to independently create and manage groups on any networked workstation using global user identities and to control access to shared data and storage resources based on group membership, regardless of domain boundaries or underlying file systems. Decentralized groups are decoupled from shared user databases and centralized authentication servers through the use of a virtual user namespace. We describe how owners of shared resources can define security policies through the use of caching, and demonstrate how each caching policy represents tradeoffs between performance, scalability, and consistency.
Automatic program synthesis: from CAD to CAM
Authors: Robert T. Chien, Tony C. Woo
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

The technology gap between design and manufacturing has stimulated a number of research projects whose common objective is to bring design specification into some form of procedure that specifies the manufacturing sequence and tool path. Most notably, there are two related areas of study---sculptured surfaces and process planning. The former is concerned with representing non-analytic surfaces in parametric forms so that points on a surface can be generated from the parametric equations as cutting tool locations. The latter is concerned with grouping conventional machine parts and describing the part in special programming languages or representing them in codes to arrive at operation sequences, choice of machine tools, cutting data, and other information.
The robot hybrid position and force control in multi-microprocessor systems
Authors: Luige Vladareanu, Ion Ion, L. Marius Velea, Daniel Mitroi
Venue: WSEAS TRANSACTIONS on SYSTEMS (2009)

This paper shows a new robot hybrid position and force control of walking robots in multimicroprocessor system in order to obtain high performances. For this purpose kinematics and kinetostatics analysis are performed, and the mathematic model of the inverted kinematics is determined for controlling the main trajectory of the robot. The method of computation in real time of the inverse Jacobean matrix, topology of transducers networks and the data flux corresponding to implementation of the multi-microprocessor system for path control of industrial robots is presented. Related to this there is presented an Open Architecture system for the robot position control in Cartesian coordinates through real time processing of the Jacobean matrix obtained out of the forward kinematics using the Denevit-Hartenberg method and calculating the Jacobean inverted matrix for feedback. The obtained results prove a significant reduction of the execution time for the real time control of robot's position in Cartesian coordinates and increased flexibility.
Managing Technical Processes Using Smart Workflows
Authors: Matthias Wieland, Daniela Nicklas, Frank Leymann
Venue: Proceedings of the 1st European Conference on Towards a Service-Based Internet (2008)

Technical processes that are crossing the boundary to the physical world can be found in many application domains, like logistics or in Smart Factory environments. We show how these processes can be realized by so-called Smart Workflows. To integrate external information sources like context provisioning services, we introduce the Integration Process architecture pattern. This pattern generally solves the problem of integrating different complex systems that provide functional similar services with non-fitting interfaces into workflows. The pattern allows that workflows use simple domain specific interfaces that are the same for any of these systems and by that allow the exchange of underlying systems without changing the workflows. This is accomplished by reducing the interface complexity of the systems via a hierarchical Web Service stack that reaches from the lowest technical granularity needed by IT experts to the domain specific granularity needed by the domain experts. Furthermore the paper presents a concrete realization of the pattern for integrating different context provisioning systems into workflows.
Enterprise Information Infrastructure: An Ideal Framework for Rapid Business System Development
Authors: Jinlei Jiang, Bo Jing, Meilin Shi
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

Driven by the difficult business environment, nowadays enterprises more and more resort to information technology to manage nearly everything internal and to conduct business activities. This puts forward high requirements on information systems and in turn, raises a great challenge to software vendors. In this paper, an enterprise information infrastructure (EII), which delivers some common functions to management and business, is proposed for software vendors to rapidly develop various enterprise information systems while at a cost as low as possible. The paper details the philosophy behind EII and explains its approaches to integration, automation and business agility. A scenario is also presented illustrating the usage of EII.