ppxscal/embedding_network huggingface dataset:
Symmetric relations and cardinality-bounded multisets in database systems
Authors: Kenneth A. Ross, Julia Stoyanovich
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

In a binary symmetric relationship, A is related to B if and only if B is related to A. Symmetric relationships between k participating entities can be represented as multisets of cardinality k. Cardinality-bounded multisets are natural in several real-world applications. Conventional representations in relational databases suffer from several consistency and performance problems. We argue that the database system itself should provide native support for cardinality-bounded multisets. We provide techniques to be implemented by the database engine that avoid the drawbacks, and allow a schema designer to simply declare a table to be symmetric in certain attributes. We describe a compact data structure, and update methods for the structure. We describe an algebraic symmetric closure operator, and show how it can be moved around in a query plan during query optimization in order to improve performance. We describe indexing methods that allow efficient lookups on the symmetric columns. We show how to perform database normalization in the presence of symmetric relations. We provide techniques for inferring that a view is symmetric. We also describe a syntactic SQL extension that allows the succinct formulation of queries over symmetric relations.
Interview with David Wertheimer: (August 10, 2007)
Authors: Newton Lee
Venue: Computers in Entertainment (CIE) (2007)

David Wertheimer is Executive Director of the Entertainment Technology Center (ETC) at the University of Southern California. Prior to his ETC post, he was the executive director of USC's Institute for Creative Technologies. His experience also includes terms as the president of the Digital Entertainment division of Paramount Pictures; founder and CEO of WireBreak Entertainment; and technology and business management positions at Oracle and NeXT. In the video interview, you will hear answers to the following questions: 1. What are the technological and sociological implications of providing content to consumers who desire it at any time and any place? 2. You once said that "The world of interactivity and entertainment is converging." Would you like to elaborate on your statement? 3. Can you tell us about the state-of-the-art Digital Content Center that you are building at the ETC? 4. What is the biggest challenge for the ETC today and what is your grand vision for the future of the ETC? 5. What are some of the current activities at the ETC? 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
Unified Design of Self-Checking and Fail-Safe Combinational Circuits and Sequential Machines
Authors: M. Diaz
Venue: IEEE Transactions on Computers (1979)

This correspondence deals with a unification and extension of some previous work on self-checking (SC) and fail-safe (FS) systems.
LSMR: A Label Switching Multipath Routing Protocol for Ad Hoc Networks
Authors: Wei Rong, Muqing Wu, Tianhang Yu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

An important requirement for the future Ad Hoc networks is to provide QoS guarantees for real-time multimedia application. Multipath routing can be used to provide route resilience, smaller end-to-end delay and better load balancing in Ad Hoc networks, while MPLS technology can provide QoS and traffic engineering in wired networks. By merging MPLS technology into multipath routing, a novel routing protocol, label switching multipath routing protocol (LSMR), has been proposed in order to provide QoS guarantees in Ad Hoc networks. LSMR can establish multiple node disjoint LSPs between source and destination and provide Ad Hoc networks with rapid label-based packet switching. Simulation results show that compared with AODV, LSMR can provide rapid packet forwarding while routing overhead is also decreased.
Slices Mining Based on Singular Value
Authors: Lijie Zhang, Haili Yin, Hui Liu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Slice is one of the major operations in on-line analysis processing which has played an important role in the application of decision support. Based on data cube, by mining the maximum singular value of the slices, a method was proposed in this paper to extract the inner rules of movement. Algebraic theories proved that it is feasible. And the numerical experiment also demonstrated that it is efficient.
Workshop Report: MICRO-9
Authors: R. H. Eckhouse
Venue: Computer (1976)

Birds-of-a-feather sessions and a small workshop flavor were the dominant features of Micro-9, the Ninth Annual Microprogramming Workshop, held September 27-29 in New Orleans. Sponsored by ACM SIGMICRO and the IEEE Computer Society, this year's workshop drew 113.
A Hybrid Transgenetic Algorithm for the Prize Collecting Steiner Tree Problem
Authors: Cristine Schmidt, Elizabeth F. G. Goldbarg, Marco C. Goldbarg
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

This work presents a hybrid transgenetic algorithm to solve the Prize Collecting Steiner Tree Problem, an NP-hard combinatorial optimization problem. The proposed approach is based upon endosymbiosis and other transformations of the biological intracellular flow. It is an evolutionary algorithm hybridized with a path-relinking procedure. The algorithm is described and its results are compared with the results of two other approaches proposed previously. The computational experiment shows that the proposed approach is very effective for this problem.
A Control-Point-Based Sweeping Technique
Authors: Sabine Coquillart
Venue: IEEE Computer Graphics and Applications (1987)

This article presents a general sweeping technique for nonuniform rational B-splines. This operator allows sweeps with several cross sections along a 3D path. One can scale the cross sections along the path according to the shape of a profile curve. The definition of the resulting surface is inherited from the initial curves, and you compute its control mesh from the control polygon of these curves. We shall consider several special cases, like straight lines and rational curves; characteristics of circles and straight lines are preserved.
Using a Configurator for Predictable Component Composition
Authors: Varvana Myllarniemi, Mikko Raatikainen, Tomi Mannisto
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

Predicting the properties of a component composition has been studied in component-based engineering. However, most studies do not address how to find a component composition that satisfies given functional and nonfunctional requirements. This paper proposes that configurable products and configurators can be used for solving this task. The proposed solution is based on the research on traditional, mechanical configurable products. Due to the computational complexity, the solution should utilise existing techniques from the field of artificial intelligence. The applicability of the approach is demonstrated with KumbangSec, which is a conceptualisation, a language and a configurator tool for deriving component compositions with given functional and security requirements. KumbangSec configurator utilises existing inference engine smodels to ensure efficiency.
Application Briefs
Venue: IEEE Computer Graphics and Applications (1983)

Computers from three companies¿Xerox, Symbolics, and Lisp Machine¿have been increasingly employed in computer graphics applications, although they were designed particularly to meet the needs of the artificial intelligence community. 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
A Component-based Coordination Language for Efficient Reconfigurable Streaming Applications
Authors: Maik Nijhuis, Herbert Bos, Henri E. Bal
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Consumer electronics applications are becoming increasingly complex because of increased functionality requirements, such as watching multiple compressed video streams on a single screen. We address this complexity by allowing a programmer to specify the application in terms of independent components. Components interact using streaming communication and by sending and receiving events. From this component specification, the executable is generated. We use the Hinch run time system and the SpaceCAKE architecture to validate the effectiveness of our approach. Because the specification language is generic, the application can easily be ported to different platforms.
An adaptive multiuser detector for DS-CDMA systems in multipath fading channels
Authors: Min Li, Walaa Hamouda
Venue: International Journal of Communication Systems (2007)

In this paper, we investigate the performance of an adaptive multistage detection scheme for direct-sequence code-division multiple-access (DS-CDMA) systems. The first stage consists of an adaptive multiuser detector which is based on the linear constrained minimum variance (LCMV) criterion. The interference cancellation (IC) occurs in the second stage. The performance of the iterative receiver over both flat and frequency-selective fading channels is investigated and compared to the single-user bound. In all cases, and under heavy system loads with near-far problems, the iterative receiver is shown to offer substantial performance improvement and large gain in user-capacity relative to the standard LCMV. In flat-fading channels, our results show that the performance of the iterative detector is very close to the single-user bound. For the frequency-selective channel, this performance is noted to be in the order of 1&thinsp;dB far from the single-user bound. Copyright &copy; 2007 John Wiley & Sons, Ltd.
A New Metric for Classification of Multivariate Time Series
Authors: Heshan Guan, Qingshan Jiang, Zhiling Hong
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Multivariate time series are an important kind of data collected in many domains, such as multimedia, biology and so on. We focus on discrimination metric for time series data; especially classify the multivariate time series as stationary or non-stationary. In this paper we will present a new metric, the nonlinear trend of the cross-correlation matrix, for classification of multivariate time series, which could well depict the stationarity of multivariate time series. The proposed approach has been tested using two datasets, one natural and one synthetic, and is shown to our metric is more efficient than the benchmark metric in all cases. We take K-means clustering in the experiment.
A Productivity Centered Tools Framework for Application Performance Tuning
Authors: H. Wen, S. Sbaraglia, S. Seelam, I. Chung, G. Cong, D. Klepacki
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

Our productivity centered performance tuning framework for HPC applications comprises of three main components: (1) a versatile source code, performance metrics, and performance data visualization and analysis graphical user interface, (2) a unique source code and binary instrumentation engine, and (3) an array of data collection facilities to gather performance data across various dimensions including CPU, message passing, threads, memory and I/O. We believe that the ability to decipher performance impacts at the source level and the ability to probe the application with different tools at the same time at varying granularities, while hiding the complications of binary instrumentation, leads to higher productivity of scientists in understanding and tuning the performance of associated computing systems and applications.
Using GHSOM to construct legal maps for Taiwan's securities and futures markets
Authors: Jen-Ying Shih, Yu-Jung Chang, Wun-Hwa Chen
Venue: Expert Systems with Applications: An International Journal (2008)

A good legal knowledge representation system, capable of effectively providing investors with comprehensive legal knowledge, is needed for investors to prevent erratic behavior before investment decisions. This is especially important in Taiwan's securities and futures markets because the majority of market participants are individual investors who have limited access to legal knowledge about markets. Besides, the construction of the knowledge representation has to be automatic in order to efficiently handle the fast-growing and changeable legal information. Thus, we use the GHSOM algorithm to present a content-based and easy-to-use map hierarchy for Chinese legal documents in the securities and futures markets in the Chinese language. Meanwhile, an enhanced topic selection module and a web-based user interface are also proposed. The maps can be browsed on the web site (http://synteny.iis.sinica.edu.tw/legalmap/). To evaluate the legal maps, we apply two approaches, namely a validity test and a task experiment.
Synthesis of Multithreshold Tree Networks
Authors: O. Ishizuka
Venue: IEEE Transactions on Computers (1977)

-A multithreshold network realizes a multithreshold logic function of an equivalent analog excitation e which in turn could be realized by a weighted input network of Boolean variables. This correspondence presents the synthesis of multithreshold tree networks with conventional single-threshold elements. The maximum number of thresholds realized by the tree network is derived by using the graphical method. Each value of these thresholds can be set arbitrarily.
Conflict between privacy and personalisation in a pervasive service environment
Authors: M. Howard Williams, Elizabeth Papadopoulou, Nick Taylor, Sarah McBurney, Kajetan Dolinar
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

For a pervasive system to function effectively in a world in which the user is surrounded by a large number of heterogeneous computing devices and communication systems, it is essential to provide adequate support for the user. For this personalisation is the key element, both for improving the user experience and for enabling it to function without the need for unnecessary interaction with the user. In pervasive systems personalisation can take a number of different forms, and four different forms of personalisation that have been incorporated into the pervasive system developed in the Daidalos project are described. The paper also describes two different approaches used to protect the privacy of the user in the two phases of Daidalos. However, there is an interaction between personalisation and privacy and some of the issues involved are discussed. These also affect proactive behaviour of the system. They are currently being used to plan the development of the second phase of the Daidalos pervasive system.
Consistent Feature Selection for Pattern Recognition in Polynomial Time
Authors: Roland Nilsson, José M. Peña, Johan Björkegren, Jesper Tegnér
Venue: The Journal of Machine Learning Research (2007)

We analyze two different feature selection problems: finding a minimal feature set optimal for classification (MINIMAL-OPTIMAL) vs. finding all features relevant to the target variable (ALL-RELEVANT). The latter problem is motivated by recent applications within bioinformatics, particularly gene expression analysis. For both problems, we identify classes of data distributions for which there exist consistent, polynomial-time algorithms. We also prove that ALL-RELEVANT is much harder than MINIMAL-OPTIMAL and propose two consistent, polynomial-time algorithms. We argue that the distribution classes considered are reasonable in many practical cases, so that our results simplify feature selection in a wide range of machine learning tasks.
Distributed top-N query processing with possibly uncooperative local systems
Authors: Clement Yu, George Philip, Weiyi Meng
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

We consider the problem of processing top-N queries in a distributed environment with possibly uncooperative local database systems. For a given top-N query, the problem is to find the N tuples that satisfy the query the best but not necessarily completely in an efficient manner. Top-N queries are gaining popularity in relational databases and are expected to be very useful for e-commerce applications. Many companies provide the same type of goods and services to the public on the Web, and relational databases may be employed to manage the data. It is not feasible for a user to query a large number of databases. It is therefore desirable to provide a facility where a user query is accepted at some site, suitable tuples from appropriate sites are retrieved and the results are merged and then presented to the user. In this paper, we present a method for constructing the desired facility. Our method consists of two steps. The first step determines which databases are likely to contain the desired tuples for a given query so that the databases can be ranked based on their desirability with respect to the query. Four different techniques are introduced for this step with one requiring no cooperation from local systems. The second step determines how the ranked databases should be searched and what tuples from the searched databases should be returned. A new algorithm is proposed for this purpose. Experimental results are presented to compare different methods and very promising results are obtained using the method that requires no cooperation from local databases.
Introduction to the Wellmade Design Methodology
Authors: D. L. Boyd
Venue: IEEE Transactions on Software Engineering (1978)

An overview of a design methodology called WELLMADE is presented. WELLMADE is a synthesis of results obtained from recent research on software engineering and the experience gained at HIS/Phoenix. The principles, procedures, and notation of WELLMADE are briefly outlined and an example is presented, illustrating the approach for deriving correct programs and the notation for its design specification.
A Time-Triggered Distributed Object Computing Environment for Embedded Control Systems
Authors: Tasuku Ishigooka, Takanori Yokoyama
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

The paper presents a time-triggered distributed object computing environment for embedded control systems such as automotive control systems. The time-triggered architecture is suitable for hard real-time systems. We present a time-triggered distributed object model as an extension to the time-triggered object model that consists of objects periodically updating their own attribute values. The model is suitable for embedded control systems in which the control logics are designed with control block diagrams. Replica objects are used for efficient location transparency in the model and inter-object communications are local method calls, not remote method invocations. We have developed a distributed computing environment based on the timetriggered distributed object model. The middleware maintains the replicas to be consistent with the original objects using periodic state messages. The middleware executes the replication processing with the stubs that bridge the original objects, the middleware, and the replicas. We have also developed a development environment for embedded control application programs based on the time-triggered distributed object model. The stubs are generated from the interface definitions written in CORBA-compliant IDL.
Simulating the Soil Erosion Process in Reservoir Area Based on the Technology of VRGIS
Authors: Jiang Huixian, Lin Guangfa, Zhang Mingfeng, Huang Wanli
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper presented a case study of how to integrate virtual reality (VR) technology with geographical information system (GIS) for the simulating the soil erosion process in Dongzhen reservoir of Fujian province, China. The research work was divided into three parts: (1) building a three dimension simulated environment of the whole reservoir area with remotely sensed image SPOT5 and digital elevation model (DEM) driven from contour relief map, and (2) modeling the soil erosion process and visualizing the dynamic process on a computer, and (3) predicting the father evolution of erosion process via changing the affecting factors and visualizing the future scenario of the reservoir area. After introducing the profile of research site, we presented simulating reservoir project which based on the VRGIS is bringing forward. And the spatial information visualization of reservoir area is also implemented. Take the Dongzhen reservoir of Fujian province as the typical case, the environment condition and basin status around the reservoir area is simulate for display based on the VRGIS technology, the 3d simulation scene of soil and water erosion status and dam is build by the project of water and soil conservation simultaneity. Through this method, combined the integration of flood analysis feature and 3D spatial, using the special function of GIS in spatial data processing and analysis, the unite of data and graph of monitor and predict system of water and soil erosion is also realized, the scientific characteristic of monitor and prediction of water and soil erosion is also strengthened, provide a reliable information source for reducing the harm of water and soil erosion.
Scanning Delays in 802.11 Networks
Authors: David Murray, Michael Dixon, Terry Koziniec
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

The proliferation of Wireless LANs and the increasing integration of voice into data networks has created the potential for VoWLANs (Voice over Wireless Local Area Networks). This technology has immense cost saving potential and the ability to provide better service and functionality. However, before the integration of VoWLAN is possible, handoff delays must be reduced. Currently, the connectivity transition that occurs from moving between APs (Access Points) is too long, causing poor voice quality and call dropouts. An experimental approach is used to investigate a particular handoff delay known as the scanning delay. The study concludes that the primary source of delay in the scanning process is caused by overlapping channels in the 2.4GHz band.
Performance Issues in Back-End Storage Networks
Authors: I. Chlamtac
Venue: Computer (1980)

A back-end storage network allows heterogeneous mainframes and devices to share resources, unhampered by hardware compatibility requirements. This flexibility has implications for the network's performance.
Rescuing Code
Authors: J. B. Rainsberger
Venue: IEEE Software (2007)

The term "heat death" comes from the second law of thermodynamics: entropy within a closed system increases over time without bound until the system collapses. In software, the entropy we experience most is in the design, and project heat death occurs when the design rots to the point where starting over is cheaper than continuing. If we focus on learning how to improve the design and combine this attitude with simple design heuristics, common sense, and experience, we can make our overly constrained designs more flexible. We call this refactoring—improving the design of existing code so we can stave off heat death, perhaps indefinitely.