ppxscal/embedding_network huggingface dataset:
Mining association rules with non-uniform privacy concerns
Authors: Yi Xia, Yirong Yang, Yun Chi
Venue: Proceedings of the 9th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery (2004)

Privacy concerns have become an important issue in data mining. A popular way to preserve privacy is to randomize the dataset to be mined in a systematic way and mine the randomized dataset instead. On the other hand, people usually have different privacy concerns for different attributes in data. E.g., in survey data, the sensitivity of questions varies. Appropriate use of this information can lead to more accurate data mining results. However, this information has not been fully utilized by many privacy preserving association rule mining algorithms.In this paper, we generalize the privacy preserving association rule mining problem by allowing different attributes to have different levels of privacy, that is, using different randomization factors for values of different attributes in the randomization process. We also propose an efficient algorithm RE (Recursive Estimation) to estimate the support of itemsets under this framework. Both theoretical and empirical results show that the use of non-uniform randomization factors improves the accuracy of the support estimates, compared to the use of one conservative randomization factor.
Improvements to a triangulation-decomposition algorithm for ordinary differential systems in higher degree cases
Authors: Evelyne Hubert
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

We introduce new ideas to improve the efficiency and rationality of a triangulation decomposition algorithm. On the one hand we identify and isolate the polynomial remainder sequences in the triangulation-decomposition algorithm. Subresultant polynomial remainder sequences are then used to compute them and their specialization properties are applied for the splittings. The gain is two fold: control of expression swell and reduction of the number of splittings. On the other hand, we remove the role that initials had in previous triangulation-decomposition algorithms. They are not needed in theoretical results and it was expected that they need not appear in the input and output of the algorithms. This is the case of the algorithm presented. New algorithms are presented to compute a subsequent characteristic decomposition from the output of the triangulation decomposition algorithm where the initials need not appear.
Recursive prime numbers
Authors: Sabin Tabirca, Kieran Reynolds
Venue: Smarandache Notions Journal (2004)

Many researchers study prime numbers for the curiosities that they possess rather than the position they occupy at the foundations of Number Theory. This study may be in any numbers of areas from applications to multimedia to searching for special or unusual primes. It is truly awe inspiring to see how much time can be expended on prime numbers without a realistic application.In this article, a sequence of prime numbers, called Recursive Prime Numbers, is identified before a complete search is undertaken to verify that the sequence is finite by finding all existing prime numbers of the specified form. This could be done with considerable effort by hand, but here a simple computer program has been used to speed the calculations. So now the question must be answered; what are recursive prime numbers. The easiest way to answer that is to say that a prime number is recursively prime if the number is prime can be constructed by adding a digit to an already recursive prime number.
Assembly and measuring technique for the manufacturing of active micro systems
Authors: J. Hesselbach, R. Tutsch, S. B&#x00fc;ttgenbach, G. Pokar, S. B&#x00fc;tefisch, M. Berndt
Venue: Microsystem Technologies (2004)

This paper presents the current results of the development of an assembly equipment with integrated measuring system that will permit a high position accuracy. The kernel of the work is an parallel robot, an innovative optical sensor for 3 dimension and an micro gripper.
Interactive modeling of trees by using growth simulation
Authors: Katsuhiko Onishi, Shoichi Hasuike, Yoshifumi Kitamura, Fumio Kishino
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2003)

We propose a real-time interactive system that enables users to generate, manipulate and edit the shape model of a tree based on growth simulation by directly indicating its global and spatial information. For this purpose, three-dimensional (3D) spatial information is introduced to the well-known L-system as an attribute of the growth simulation. Moreover, we propose an efficient data structure of L-strings in order to speed up the process.
Supporting healthcare communication enabled by Information and Communication Technology: can HCI and related cognitive aspects help?
Authors: Laurence Alpay, Pieter Toussaint, Bertie Zwetsloot-Schonk
Venue: Proceedings of the conference on Dutch directions in HCI (2004)

Communication in healthcare makes up an important part of the healthcare professionals' daily practices. Communication encompasses different forms of interaction and dissemination of health-related information, and takes place in contexts such as patient/healthcare professional relationships, and collaborative care. While Information and Communication Technology (ICT) offers a useful means to support the accessibility, the exchange and the sharing of information, the cognitive complexity of these communication processes often remains undermined. Much can be learned from research in Human Computer Interaction (HCI) with its focus on cognitive aspects. This has relevant implications for our work in healthcare communication enabled by ICT.
Extracting 3D Stylized Accentuation Effects from a Painted Image
Authors: Tomoya Sato, Yoshinori Dobashi, Tsuyoshi Yamamoto, Katsumi Takao, Ken Anjyo
Venue: Proceedings of the Computer Graphics International (2004)

In a cel animation workplace, non-photorealistic renderingtechniques are often applied to a 3D scene model, whichis constructed by referring to the 2D hand-drawn images ofthe scene. There exist a lot of scene features that must bemodeled from the 2D information. The accentuation effectsare amongst the most important features in a hand-drawnscene. In this context, accentuation refers to adding hand-drawnshading of the scene. The specific region that anartist wishes the viewer to observe is drawn brighter thanthe other regions.In this paper, a method is proposed for the extractionof the accentuation effects from a single 2D painted imageof an animated scene. This method enables the automaticaddition of the accentuation effects to each frame of the animation,observed from other viewpoints.
Neural Network Approach for Linearization of the Electrostatically Actuated Double-Gimballed Micromirror
Authors: Guangya Zhou, Kelvin K. L. Cheo, Francis E. H. Tay, Fook Siong Chau
Venue: Analog Integrated Circuits and Signal Processing (2004)

In this paper, a hierarchical circuit based approach is used for the development of a reduced-order macro-model for a double-gimballed electrostatic torsional micromirror. The nonlinearity and cross-axis coupling of the micromirror subjected to the differential driving scheme are investigated using the proposed macro-model. The simulation results are used to train a feed-forward neural network which carries out a function approximation of the relation between the desired location and the required driving voltages. The trained neural network is then coded into MAST AHDL. System-level simulation of the micromirror together with the neural network is performed in the SABER&trade; simulator. It is found that using a feed-forward neural network, the linearity of the micromirror is greatly improved, the steady state of the cross-axis coupling is reduced to a negligible level and the transient response of the cross-axis coupling is also suppressed. This implies that introducing a feed-forward neural network would be useful to simplify the design of the feedback control system for the double-gimballed electrostatic torsional micromirror.
Reducing non-determinism in right nulled GLR parsers
Authors: Elizabeth Scott, Adrian Johnstone
Venue: Acta Informatica (2004)

Tomita&#x2019;s general parsing algorithm is linear on LR(1) grammars but fails to terminate on grammars with hidden left recursion and is not efficient in the presence of $\epsilon$-rules. When Right Nulled (RN) parse tables are used Tomita style GLR algorithms operate correctly and more efficiently on all context free grammars. However, an RN table may contain more conflicts than the corresponding LR table, making the construction of parts of the internal structure redundant. We show that in certain cases conflicts can be removed from an RN table without compromising the correctness of the associated parser. In particular, all conflicts can be removed if the grammar is LR(1). This improves the performance of the parser and allows resolved RN tables for LR(1) grammars to be used with standard (deterministic) LR stack-based parsing algorithms, adding the &#x2018;short-circuiting&#x2019; of right nullable reductions to the armoury of efficient implementation techniques for such algorithms.
Forage drying models for oats and vetches under Mediterranean climate conditions
Authors: A. C. Pinheiro, J. O. Peça
Venue: Mathematics and Computers in Simulation (2004)

This paper reports the results of experimental and model studies of the field drying process of forage composed of oats and vetches. Under Mediterranean conditions, the drying process was observed in two consecutive years. Different cutting dates, different mowers, with and without conditioners, and different raking treatments were compared for their effect on forage moisture content reduction during the haymaking process. Physically based models were developed to determine the influence of weather and operational factors, that have major influences on the drying process in the field of the whole swath, oats, vetches and "other species". Among the operational factors, the conditioning effect was always the most important in the prediction equations, modelling the whole swath field drying process. Raking 24h after mowing also had a positive influence on moisture loss. Vapour pressure deficit and wind velocity were the weather variables that had the greatest influence on the drying process. In the equation developed to predict the drying of the swath components, the drying rate of oats was influenced by that of both the vetches and other species, and vice versa.
Finding Frequent Items in Sliding Windows with Multinomially-Distributed Item Frequencies
Authors: Lukasz Golab, David DeHaan, Alejandro Lopez-Ortiz, Erik D. Demaine
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

In this paper, we present an algorithm for identifying frequently occurring items within a sliding window of the last N items seen over an infinite data stream,given the following constraints.
On Stochastic Bounds for Monotonic Processor Sharing Networks
Authors: T. Bonald, A. Proutière
Venue: Queueing Systems: Theory and Applications (2004)

We consider a network of processor sharing nodes with independent Poisson arrival processes. Nodes are coupled through their service capacity in that the speed of each node depends on the number of customers present at this and any other node. We assume the network is monotonic in the sense that removing a customer from any node increases the service rate of all customers. Under this assumption, we give stochastic bounds on the number of customers present at any node. We also identify limiting regimes that allow to test the tightness of these bounds. The bounds and the limiting regimes are insensitive to the service time distribution. We apply these results to a number of practically interesting systems, including the discriminatory processor sharing queue, the generalized processor sharing queue, and data networks whose resources are shared according to max&ndash;min fairness.
FAIR: Fee Arbitrated Incentive Architecture in Wireless Ad Hoc Networks
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

In ad hoc wireless networks, nodes communicatethrough a cooperative network in which other nodes functionas relays. Since resources are frequently constrained, incentivesmust be provided to entice nodes to relay. The correct amountof incentive is essential to the efficient and optimal operation ofthe network. Excessive incentive results in widespread altruism,leading to diminished system lifetime. In contrast, insufficientincentive leads to selfish nodes that dramatically decrease networkthroughput. Nodes are assumed to be rational, and seekto maximize their own utilities. In this paper, we use virtualcredits as the incentive to stimulate cooperative behavior betweennodes. The result of this research is Fee Arbitrated IncentiveArchitecture (FAIR), an application layer protocol that enhancesfairness and collaboration in ad hoc wireless networks. FAIRutilizes autonomous feedback mechanisms to configure itselfto the changing demands of the nodes, users, and networkconditions. PriceSim, a network simulator implementing theFAIR protocol, was created to evaluate FAIR's performance.
A special purpose array processor architecture for the molecular dynamics simulation of point-mutated proteins
Authors: Karl-Heinz Zimmermann
Venue: Journal of VLSI Signal Processing Systems (2003)

Point mutation of amino acids is a means used by biotechnologists to improve the performance of proteins. To study a point-mutated polypeptide, one requires its global minimum energy conformation. This conformation can be determined by molecular dynamics via Langevin's equations of motion. Molecular dynamics simulations belong to the most difficult problems to parallelize in a scalable manner. We provide a method for defining a special purpose 3D array processor architecture for the molecular dynamics simulation of point-mutated polypeptides. The architecture is derived from a spatial decomposition of a known conformation of the point-mutated polypeptide or the native conformation of the given protein. By using an approximation scheme for the deterministic forces, the interprocessor communication can be kept local. The architecture affords a simple distributed load balancer and is scalable. The computational workload of the array processor architecture to perform molecular dynamics simulations under realistic conditions is addressed. An example architecture is given by point-mutated penicillin amidase.
Applying case-based reasoning and multi-agent intelligent system to context-aware comparative shopping
Authors: Oh Byung Kwon, Norman Sadeh
Venue: Decision Support Systems (2004)

Comparative shopping is a promising web service in the field of mobile commerce. This paper aims to propose a context-aware comparative shopping. Multi-agent intelligent architecture is adopted to implement the autonomous negotiation mechanism between buyers and sellers. To automatically estimate user preferences to determine the best purchase, case-based reasoning and negotiation mechanism are utilized. We developed a prototype system and experiment to show the possibility of the mechanism proposed in this paper. We found that our mechanism with multi-agents yields more pay-off, total sales, and wins than the system without those features.
The Impact of Technology Scaling on Lifetime Reliability
Authors: Jayanth Srinivasan, Sarita V. Adve, Pradip Bose, Jude A. Rivers
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

The relentless scaling of CMOS technology has provideda steady increase in processor performance for the pastthree decades. However, increased power densities (hencetemperatures) and other scaling effects have an adverse impacton long-term processor lifetime reliability. This paperrepresents a first attempt at quantifying the impact of scalingon lifetime reliability due to intrinsic hard errors, takingworkload characteristics into consideration.For our quantitative evaluation, we use RAMP [The Case for Microarchitectural Awareness of Lifetime Reliability], a previously proposed industrial-strength model that providesreliability estimates for a workload, but for a given technology.We extend RAMP by adding scaling specific parametersto enable workload-dependent lifetime reliability evaluationat different technologies.We show that (1) scaling has a significant impact on processorhard failure rates - on average, with SPEC benchmarks,we find the failure rate of a scaled 65nm processorto be 316% higher than a similarly pipelined 180nm processor;(2) time-dependent dielectric breakdown and electromigrationhave the largest increases; and (3) with scaling,the difference in reliability from running at worst-casevs. typical workload operating conditions increases significantly,as does the difference from running different workloads.Our results imply that leveraging a single microarchitecturedesign for multiple remaps across a few technologygenerations will become increasingly difficult, and motivatea need for workload specific, microarchitectural lifetimereliability awareness at an early design stage.
A short proof of non-GF(5)-representability of matroids
Authors: Jim Geelen, James Oxley, Dirk Vertigan, Geoff Whittle
Venue: Journal of Combinatorial Theory Series B (2004)

Tutte proved that a matroid is binary if and only if it does not contain a U2.4-minor. This provides a short proof for non-GF(2)-representability in that we can verify that a given minor is isomorphic to U2.4 in just a few rank evaluations. Using excluded-minor characterizations. short proofs can also be given of non-representablity over GF(3) and over GF(4). For GF(5), it is not even known whether the set of excluded minors is finite. Nevertheless, we show here that if a matroid is not representable over GF(5), then this can be verified by a short proof. Here a "short proof" is a proof whose length is bounded by some polynomial in the number of elements of the matroid. In contrast to these positive results, Seymour showed that we require exponentially many rank evaluations to prove GF(2)-representability, and this is in fact the case for any field.
AutoPart: Automating Schema Design for Large Scientific Databases Using Data Partitioning
Authors: Stratos Papadomanolakis, Anastassia Ailamaki
Venue: Proceedings of the 16th International Conference on Scientific and Statistical Database Management (2004)

Database applications that use multi-terabyte datasets arebecoming increasingly important for scientific fields such asastronomy and biology. Scientific databases are particularlysuited for the application of automated physical design techniques,because of their data volume and the complexity of thescientific workloads. Current automated physical design toolsfocus on the selection of indexes and materialized views. Inlarge-scale scientific databases, however, the data volume andthe continuous insertion of new data allows for only limitedindexes and materialized views. By contrast, data partitioningdoes not replicate data, thereby reducing space requirements andminimizing update overhead. In this paper we present AutoPart,an algorithm that automatically partitions database tables tooptimize sequential access assuming prior knowledge of a representativeworkload. The resulting schema is indexed using a fractionof the space required for indexing the original schema. Toevaluate AutoPart we built an automated schema design tool thatinterfaces to commercial database systems. We experiment withAutoPart in the context of the Sloan Digital Sky Survey database,a real-world astronomical database, running on SQL Server2000. Our experiments demonstrate the benefits of partitioningfor large-scale systems: Partitioning alone improves query executionperformance by a factor of two on average. Combinedwith indexes, the new schema also outperforms the indexed originalschema by 20% (for queries) and a factor of five (forupdates), while using only half the original index space.
A High Speed FPGA Implementation of the Rijndael Algorithm
Authors: Refik Sever, A. Neslin Ismailglu, Yusuf C. Tekmen, Murat Askar, Burak Okcan
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

This paper presents a high speed, non-pipelined FPGA implementation of the Rijndael Algorithm [AES Proposal: Rijndael, AES algorithm submission], which has been selected as the new AES Algorithm [Draft FIPS for the AES] by the National Institute of Standards and Technology (NIST) [National Institute of Standards and Technology]. In this study, we have implemented both the encryption and the decryption algorithms of Rijndael on the same FPGA. All the key and data length combinations of the original Rijndael Algorithm are supported. This implementation, which uses 8378 slices and 4 Block RAM's of the Xilinx FPGA, has a worst case operating frequency of 65 MHz, yielding a maximum throughput of 1.19 Gb/s.
A causal message logging protocol for mobile nodes in mobile computing systems
Authors: JinHo Ahn, Sung-Gi Min, Chong-Sun Hwang
Venue: Future Generation Computer Systems (2004)

This paper presents a causal message logging protocol with independent checkpointing for mobile nodes with the aim of efficiently handling several constraints of the mobile nodes such as mobility and disconnection, limited life of battery power, small amount of storage and low bandwidth on wireless link. For this purpose, the protocol includes a low-cost failure-free mechanism requiring only locating the mobility agent maintaining the latest checkpoint of each process on an mobile node during its handoff process. This mechanism forces only the latest checkpoint to be maintained on the stable storage while incurring low failure-free overhead. Also, the protocol uses two garbage collection schemes to remove log information of mobile nodes. The first scheme enables each mobile node to autonomously remove useless log information in its storage by piggybacking only some additional information without requiring any extra message and forced checkpoint. The second scheme allows the mobile node to remove a part of log information in its storage if more empty storage space is required after executing the first scheme. It reduces the number of processes to participate in the garbage collection by using the size of the log information of each process. Simulation results show that the two proposed schemes significantly reduce the garbage collection overhead compared with traditional schemes. Additionally, we present an efficient recovery algorithm to avoid frequent stable storage accesses, impose no restriction on the execution of live processes during recovery and ensure consistent recovery in case of being integrated with independent checkpointing.
Building Desktop Applications with Web Services in a Message-based MVC Paradigm
Authors: Xiaohong Qiu
Venue: Proceedings of the IEEE International Conference on Web Services (2004)

Over the past decade, classic client side applications with Model-View-Controller (MVC)architecture haven't changed much but become more complex. In this paper, we present anapproach of building desktop applications with Web Services in an explicit message-based MVC aradigm. By integrating with our publish/subscribe messaging middleware, itmakes SVG browser (a Microsoft PowrrPoint like client application) with Web Service styleinterfaces universally accessible from different client platforms - Windows, Linux, MacOS,PalmOS and other customized ones. Performance data suggests that this scheme ofbuilding application around messages is a practical architecture for the next generationWeb application client.