ppxscal/embedding_network huggingface dataset:
Collaborative Filtering by Mining Association Rules from User Access Sequences
Authors: Mei-Ling Shyu, Choochart Haruechaiyasak, Shu-Ching Chen, Na Zhao
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

Recent research in mining user access patterns for predicting Web page requests focuses only on consecutive sequential Web page accesses, i.e., pages which are accessed by following the hyperlinks. In this paper, we propose a new method for mining user access patterns that allows the prediction of multiple non-consecutive Web pages, i.e., any pages within theWeb site. Our approach consists of two major steps. First, the shortest path algorithm in graph theory is applied to find the distances between Web pages. In order to capture user access behavior on the Web, the distances are derived from user access sequences, as opposed to static structural hyperlinks. We refer to these distances as Minimum Reaching Distance (MRD) information. The association rule mining (ARM) technique is then applied to form a set of predictive rules which are further refined and pruned by using the MRD information. The proposed approach is applied as a collaborative filtering technique to recommend Web pages within a Web site. Experimental results demonstrate that our approach improves performance over the existing Markov model approach in terms of precision and recall, and also has a better potential of reducing the user access time on the Web.
A simple methodology for the production of three-dimensional models: serotonin transporter as an example
Authors: Paul A. Wilson
Venue:  (2004)

A conceptually simple and clearly rigorous paradigm for finding molecular similarity has been developed to elucidate three-dimensional (3-D) pharmacophore templates utilizing multi-molecule constructs without dependence upon a specific software package. A multi-molecular approach has been taken to limit induced model bias from any single molecule. The methodology involves the construction of a pharmacophore foundation from the low energy conformations identified for a select set of molecules exhibiting established potency and selectivity for the binding domain of interest. These low energy conformations are combinatorially compared to identify one set (1 set = 1 low energy conformation from each molecule) possessing the highest degree of similarity in 3-D space. This technique has been applied to produce a 3-D pharmacophore model of the serotonin selective reuptake inhibitor (SSRI) binding domain of the serotonin transporter (SERT). A set of four molecules possessing a high measure of SERT selectivity, potency and offering ample structural diversity was identified and select conformations (non-global minima) were attained. Similarity was based on distance space descriptions compared using a relative difference calculation. The relative difference equation compares the magnitudes of two measurements and produce a ratio which, in effect, describes their similarity. Data sets with measurements on both sides of zero may be overly, or not adequately, penalized with consideration to the actual magnitude between the measures. An algorithm for accomplishing a reasonable implementation of the relative difference equation when a known value does not exist, has been developed. A computational algorithm and programs have been developed that, in conjunction with novel modeling methodologies, have led to an unambiguous and descriptive 3D pharmacophore model of the SSRI binding domain at the SERT. The predictive quality of the model was demonstrated through application, by the design of a family of novel, highly potent SERT inhibitor ligands (Ki < 100 pM), exemplified by 2 &prime;-methyl-6-nitroquipazine.
Recovering 3D Human Pose from Monocular Images
Authors: Ankur Agarwal, Bill Triggs
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

We describe a learning-based method for recovering 3D human body pose from single images and monocular image sequences. Our approach requires neither an explicit body model nor prior labeling of body parts in the image. Instead, it recovers pose by direct nonlinear regression against shape descriptor vectors extracted automatically from image silhouettes. For robustness against local silhouette segmentation errors, silhouette shape is encoded by histogram-of-shape-contexts descriptors. We evaluate several different regression methods: ridge regression, Relevance Vector Machine (RVM) regression, and Support Vector Machine (SVM) regression over both linear and kernel bases. The RVMs provide much sparser regressors without compromising performance, and kernel bases give a small but worthwhile improvement in performance. The loss of depth and limb labeling information often makes the recovery of 3D pose from single silhouettes ambiguous. To handle this, the method is embedded in a novel regressive tracking framework, using dynamics from the previous state estimate together with a learned regression value to disambiguate the pose. We show that the resulting system tracks long sequences stably. For realism and good generalization over a wide range of viewpoints, we train the regressors on images resynthesized from real human motion capture data. The method is demonstrated for several representations of full body pose, both quantitatively on independent but similar test data and qualitatively on real image sequences. Mean angular errors of 4{\hbox{-}}6^\circ are obtained for a variety of walking motions.
Fuzzy Control for Guaranteeing Absolute Delays in Web Servers
Authors: Yaya Wei, Fengyuan Ren, Chuang Lin, Thiemo Voigt
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

This paper presents a fuzzy control approach that guarantees absolute delays in web servers. Previous work has proposed the use of classical PI controllers for delay guarantees. However, a disadvantage of the classical PI controller is that the system model, which is obtained by system identification, mismatches the real system and inevitably degrades the performance of the web system. In contrast with classical PI controllers, fuzzy controllers are nonlinear and therefore independent of the accurate model of the plant, i.e. the controlled system. Hence, fuzzy controllers seem to be very suitable for web servers. Our experiments show that fuzzy controllers indeed perform better than PI controllers presented in earlier papers.
FTWeb: A Fault Tolerant Infrastructure for Web Services
Authors: Giuliana Teixeira Santos, Lau Cheuk Lung, Carlos Montez
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

The web services architecture came as answers to the search for interoperability among applications. In recent years there has been a growing interest in deploying on the Internet applications with high availability and reliability requirements. However, the technologies associated with this architecture still do not deliver adequate support to this requirement. The model proposed in this article is located in this context and provides a new layer of software that acts as a proxy between client requests and service delivery by providers. The main objective is to ensure client transparent fault tolerance by means of the active replication technique. This model supports the following faults: value, omission and stops. This paper describes the features and outcomes obtained through the implementation of this model.
Uniform random numbers in APL
Authors: William R. Franta
Venue: ACM SIGSIM Simulation Digest (1976)

In the article by R. Wheeler, the author laments the integer nature of the APL operator? when faced with the need to construct a generator which produces random numbers uniformly distributed on (0, 1). The difficulty arises in that the definition specifies that ? X returns a random integer from 1 to X inclusive. It is indeed unfortunate, since in many ways APL is ideally suited to Monte Carlo experiments. Recently when designing and implementing an APL processor for the CDC 6600, the deficiency was clearly recognized. Under such conditions three possibilities exist in choosing a course of action, namely: (1) the deficiency can be ignored, (2) the operator definition can be altered, and (3) the operator definition can be extended. The design effort dictated that the processor be consistent (in every conceivable way) with the specifications given in [2] thus disallowing (2). This is important so that APL remains APL rather than a series of dialects all labeled APL. The only possible route for emmendation of the deficiency that remains, therefore, is (3).
A three-DOF translational manipulator with decoupled geometry
Authors: Weimin Li, Feng Gao, Jianjun Zhang
Venue: Robotica (2005)

A new 3-DOF translational parallel manipulator is presented in this paper. This manipulator has decoupled motion in for x, y, and z axes, and employs only revolute joints. The structure and kinematics of the manipulator are studied. The mechanism singularity is examined and the calibration methods are presented.
On the sign-imbalance of partition shapes
Authors: Jonas Sjöstrand
Venue: Journal of Combinatorial Theory Series A (2005)

Let the sign of a standard Young tableau be the sign of the permutation you get by reading it row by row from left to right, like a book. A conjecture by Richard Stanley says that the sum of the signs of all SYTs with n squares is 2⌊n/2⌋. We present a stronger theorem with a purely combinatorial proof using the Robinson-Schensted correspondence and a new concept called chess tableaux.We also prove a sharpening of another conjecture by Stanley concerning weighted sums of squares of sign-imbalances. The proof is built on a remarkably simple relation between the sign of a permutation and the signs of its RS-corresponding tableaux.
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
Authors: Yongge Wang, Xintao Wu
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

In order to generate synthetic basket datasets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket datasets. The characteristics that could be used for this purpose include the frequent itemsets and association rules. The problem of generating synthetic basket datasets from frequent itemsets is generally referred to as inverse frequent itemset mining. In this paper, we show that the problem of approximate inverse frequent itemset mining is NP-complete. Then we propose and analyze an approximate algorithm for approximate inverse frequent itemset mining, and discuss privacy issues related to the synthetic basket dataset. In particular, we propose an approximate algorithm to determine the privacy leakage in a synthetic basket dataset.
Implementing Fair Non-repudiable Interactions with Web Services
Authors: Paul Robinson, Nick Cook, Santosh Shrivastava
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

The use of open, Internet-based communications for business-to-business (B2B) interactions requires accountability for and acknowledgment of the actions of participants. Accountability and acknowledgment can be achieved by the systematic maintenance of an irrefutable audit trail to render the interaction non-repudiable. To safeguard the interests of each party, the mechanisms used to meet this requirement should ensure fairness. That is, misbehaviour should not disadvantage well-behaved parties. Despite the fact that Web services are increasingly used to enable B2B interactions, there is currently no systematic support to deliver such guarantees. This paper introduces a flexible framework to support fair non-repudiable B2B interactions based on a trusted delivery agent. A Web services implementation is presented. The role of the delivery agent can be adapted to different end user capabilities and to meet different application requirements.
A Family of Collusion Resistant Protocols for Instantiating Security
Authors: Sandeep S. Kulkarni, Bruhadeshwar Bezawada
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

In this paper, we focus on the problem of identifying a family of collusion resistant protocols that demonstrate a tradeoff between the number of secrets that users maintain and the extent of collusion resistance. Towards this end, we define classes of collusion resistant protocols (modeled along the complexity classes in algorithmic complexity) and evaluate the membership of existing protocols as well as the protocols in the proposed family in these classes. We also show that this family contains existing protocols for instantiating security.
Electric power market agent design
Authors: Robert J. Thomas
Venue:  (2005)

The electric power industry in many countries has been restructured in the hope of a more economically efficient system. In the restructured system, traditional operating and planning tools based on true marginal cost do not perform well since information required is strictly confidential. For developing a new tool, it is necessary to understand offer behavior. The main objective of this study is to create a new tool for power system planning. For the purpose, this dissertation develops models for a market and market participants. A new model is developed in this work for explaining a supply-side offer curve, and several variables are introduced to characterize the curve. Demand is estimated using a neural network, and a numerical optimization process is used to determine the values of the variables that maximize the profit of the agent. The amount of data required for the optimization is chosen with the aid of nonlinear dynamics. To suggest an optimal demand-side bidding function, two optimization problems are constructed and solved for maximizing consumer satisfaction based on the properties of two different types of demands: price-based demand and must-be-served demand. Several different simulations are performed to test how an agent reacts in various situations. The offer behavior depends on locational benefit as well as the offer strategies of competitors.
Java for Mobile Devices: A Security Study
Authors: Mourad debbabi, Mohamed Saleh, Chamseddine Talhi, Sami Zhioua
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

Java 2 Micro-Edition Connected Limited Device Con- figuration (J2ME CLDC) is the platform of choice when it comes to running mobile applications on resourceconstrained devices (cell phones, set-top boxes, etc.). The large deployment of this platform makes it a target for security attacks. The intent of this paper is twofold: First, we study the security architecture of J2ME CLDC. Second, we provide a vulnerability analysis of this Java platform. The analyzed components are: Virtual machine, CLDC API and MIDP (Mobile Information Device Profile) API. The analysis covers the specifications, the reference implementation (RI) as well as several other widely-deployed implementations of this platform. The aspects targeted by this security analysis encompass: Networking, record management system, virtual machine, multi-threading and digital right management. This work identifies security weaknesses in J2ME CLDC that may represent sources of security exploits. Moreover, the results reported in this paper are valuable for any attempt to test or harden the security of this platform.
Optimizing Software Process Based On Risk Assessment and Control
Authors: XU Ru-Zhi, NIE Pei-Yao, SAI Ying, QU Le-Hong, LEE Yun-Ting
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Choosing a correct software process and controlling the process effectively has been the key to guarantee the success of a software project. This paper presents a novel approach for assessing and optimizing a software project process based on software risk assessment and control, which evaluates and optimizes software project process from the view of controlling the software risk. A model for optimizing software risk control is given, and then a discrete optimization algorithm based on dynamic programming is proposed. An example of using above method to solve a problem is also included in this paper. By changing afterwards control passively into an effective pre-action actively, this new method can greatly promote the possibility of success of software projects.
SOUPAC: an overview
Authors: Paul Chouinard
Venue: ACM SIGSOC Bulletin (1973)

SOUPAC is a general purpose statistical package designed and implemented at the University of Illinois, Urbana-Champaign. 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
Implementing Metcast in Scheme
Authors: Oleg Kiselyov
Venue: Higher-Order and Symbolic Computation (2005)

This paper describes the experience of implementing a core component of an operationally deployed large distributed system in Scheme. Metcast is a request-reply and subscription system for the dissemination of real-time weather information. The system stores vast amounts of weather observation reports, forecasts, gridded data produced by weather models, and satellite imagery. A Metcast server delivers a subset of these data in response to a query formulated in a domain-specific declarative language. Decoders of World Meteorological Organization's data feed, the Metcast application server, XML encoders and decoders, auxiliary and monitoring CGI scripts are all written in a mostly pure functional subset of Scheme. This paper describes three examples that demonstrate the benefits of our choice of the implementation language: parsing of the data feed; XML transformations and Web services; a modular interpreter for the extensible and expressive request language. We also discuss general-purpose extensions to Scheme developed in the project.
Exploring Interaction with a Simulated Wrist-Worn Projection Display
Authors: Gabor Blasko, Steven Feiner, Franz Coriand
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

One of the major limitations of portable computing devices is the small size of their built-in displays. Fortunately, extremely small projection systems are being developed that can be integrated into devices that are small enough to be body-worn, yet can project a large image onto surfaces in the environment. To explore how a user might interact with this near-horizon technology, we created a functional simulation of a wrist-worn projector. We then developed a set of interaction techniques that assume that the wrist-worn computer and projector are equipped with position and orientation sensors, in addition to a touch-sensitive builtin screen. To complement the techniques that rely on the spatial manipulation of the user's forearm and the device itself, we also describe the use of a cursorless watch user interface that minimizes the need for the user to look down at the device's built-in screen. Finally, we present a sample application that illustrates our interaction techniques.
Automatic object extraction and reconstruction in active video
Authors: Ye Lu
Venue:  (2005)

A new method of video object extraction is proposed to accurately obtain the object of interest from actively acquired videos. Traditional video object extraction techniques often operate under the assumption of homogeneous object motion and extract various parts of the video that are motion consistent as objects. In contrast, the proposed active video object extraction (AVOE) paradigm assumes that the object of interest is being actively tracked by a camera moving in 3D and classifies the possible motions of the camera that result in the 2D motion patterns as recovered from 2D image sequences. Consequently, the AVOE method is able to extract only objects of interest from active videos while ignoring other less important objects. We formalize the AVOE process using notions from Gestalt psychology. We define a new Gestalt factor called &ldquo;shift and hold&rdquo; which acts as a bridge between 2D Gestalt groupings and 3D object perception. We also propose a novel cooperative method for efficient dense 2D motion estimation as part of the AVOE framework. Using motion fields recovered from successive frames of the video, we propose a core algorithm to perform 2D object extraction. In addition, we also propose a linear programming based boundary adjustment algorithm that takes into account the strength and orientation of candidate boundary pixels to refine object outlines extracted by the core algorithm. More effective indexing and retrieval techniques can be devised if the extracted objects are not limited only to their 2D views but can be intelligently integrated to form 3D object models. In this way, objects can be searched and retrieved using their 3D shapes in addition to the 2D image based features. In order to address this need for 3D object models, we also describe the design and implementation of an active video object extraction and 3D reconstruction system as part of this thesis.
Impact of Fowler-Nordheim and channel hot carrier stresses on MOSFETs with 2.2nm gate oxide
Authors: S. Gerardin, A. Cester, A. Paccagnella, G. Ghidini
Venue: Microelectronic Engineering (2005)

We studied the degradation of NMOSFETs with 2.2nm gate oxide subjected to Fowler-Nordheim and channel hot carrier stresses. We highlighted the differences between the two types of stresses, in particular concerning the behavior of the gate current. Before hard breakdown, Fowler-Nordheim stressed devices showed pre-breakdown and/or soft-breakdown, while progressive breakdown was much more common with channel hot carrier stresses, especially at Vgs=Vds/2. The impact of the stresses on the transfer and output characteristics of the devices was then considered. Finally, the effect of the degradation on adjacent, nominally identical MOSFETs was studied, showing potential issues for circuits that rely on matching.
Identity theft, spyware and the law
Authors: Timothy R. Loibl
Venue: Proceedings of the 2nd annual conference on Information security curriculum development (2005)

Identity theft has become a huge problem in today's society. With the advent of the computer age, came the need for information on demand. This information on demand not only made it easier for authorized users to get information, but also for unauthorized users. One-way identity thieves gain access to personal information is through the use of spyware programs. According to M. Rasch [9], spyware is "a 'deceptive' practice of the unauthorized installation of programs that monitor a consumer's activities without their consent." The government, at both the state and federal levels, has started to pass legislation regarding the use of spyware. The federal government has yet to pass a bill, but there are many different anti-spyware bills being debated in both the House and the Senate. There are seven states that have passed anti-spyware laws, and there are currently seven other states that are working toward passing anti-spyware laws of their own. The Federal Trade Commission is constantly educating the general public about the threats associated with spyware, and how to combat it. The government is currently headed in the right direction, but there is still a lot that needs to be done to help combat the problem of identity theft and spyware.