ppxscal/embedding_network huggingface dataset:
Design time support for adaptive behavior in Web sites
Authors: Sven Casteleyn, Olga De Troyer, Saar Brockmans
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Adaptive web sites are sites that automatically improve their internal organization and/or presentation by observing user-browsing behavior. In this paper we argue that adaptive behavior of websites should be controlled in order to keep the website manageable. We believe that adaptive behavior may be a useful complement to a good website design method on the condition that the adaptations are limited and according to the modeling approach followed during design. Therefore, we allow a website designer to specify at design time the adaptive behavior that will be allowed at runtime. To accomplish this goal, an Adaptation Specification Language is defined that allows designers to specify at the level of the navigational model, which adaptations could be performed at runtime. The language is event based, i.e. a collection of rules is used to specify the adaptation operations to be carried out if certain conditions are satisfied. The approach proposed is elaborated in the context of WSDM, an audience driven website design method, but is generally applicable to other design methodologies.
SEWeP: using site semantics and a taxonomy to enhance the Web personalization process
Authors: M. Eirinaki, M. Vazirgiannis, I. Varlamis
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Web personalization is the process of customizing a Web site to the needs of each specific user or set of users, taking advantage of the knowledge acquired through the analysis of the user's navigational behavior. Integrating usage data with content, structure or user profile data enhances the results of the personalization process. In this paper, we present SEWeP, a system that makes use of both the usage logs and the semantics of a Web site's content in order to personalize it. Web content is semantically annotated using a conceptual hierarchy (taxonomy). We introduce C-logs, an extended form of Web usage logs that encapsulates knowledge derived from the link semantics. C-logs are used as input to the Web usage mining process, resulting in a broader yet semantically focused set of recommendations.
Determination of Optimal Parameters for the Chebyshev-Gegenbauer Reconstruction Method
Authors: Z. Jackiewicz
Venue: SIAM Journal on Scientific Computing (2003)

We propose a new strategy for choosing the optimal parameters for the Gegenbauer reconstruction method based on Chebyshev spectral coefficients under different assumptions on the smoothness of the function f. These parameters are optimal in the sense that the bounds on the truncation and regularization errors were forced to be equal. This strategy is independent on the number of terms N in the Chebyshev expansion of the function f and guarantees exponential convergence as $N\rightarrow \infty$ of the Gegenbauer series to f on the intervals of smoothness. The effectiveness of this strategy and exponential convergence are confirmed by numerical examples for functions with varying degrees of smoothness.
Fault-sensitivity analysis and reliability enhancement of analog-to-digital converters
Authors: Mandeep Singh, Israel Koren
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2003)

Reliability of systems used in space, avionic, and biomedical applications is highly critical. Such systems consist of an analog front-end to collect data, an analog-to-digital converter (ADC) to convert the collected data to digital form, and a digital unit to process it. Though a considerable amount of research has been performed to increase the reliability of digital blocks, the same cannot be claimed for mixed-signal blocks. The reliability enhancement that we employ begins with fault-sensitivity analysis followed by redesign. The data obtained from the sensitivity analysis is used to grade blocks based on their sensitivity to faults. The highly sensitive blocks can then be replaced by more reliable alternatives. The improvement gained by opting for more robust implementations might be limited due to the number of possible implementations. In these cases, alternative reliability enhancement techniques such as adding redundancy may provide further improvements. The steps involved in the reliability enhancement of ADCs are illustrated in this paper by first proposing a sensitivity analysis methodology for α-particle induced transients and then suggesting redesign techniques to improve the reliability of the ADC. A novel concept of node weights specific to α-particle transients is introduced, which improves the accuracy of the sensitivity analysis. The fault simulations show that, using techniques such as alternative robust implementations, adding redundancy, pattern detection, and transistor sizing, considerable improvements in reliability can be attained.
An automated reasoning for diagnostic knowledge in a distributed environment
Authors: Susumu Yamasaki, Mariko Sasakura
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

This paper is concerned with a distributed logic programming, as a model of an automated reasoning for diagnostic knowledge in a distributed environment. The distributed logic program is a network of logic programs, where negation as failure is implemented through the whole network. A logic program is installed in each site of the network, for which negation as failure through the network is incorporated in (SLD) resolution. Some comment on semantics for the whole behaviour of the network is given.
An Algorithmic Model for Real-Time Computation
Authors: Selim G. Akl
Venue: Proceedings of the XXIII International Conference of the Chilean Computer Science Society (2003)

A general framework is proposed for the study of real-timealgorithms. The framework unifies previous algorithmicdefinitions of real-time computation. In it, state spacetraversal is used as a model for computational problems ina real-time environment. The proposed framework also employsa paradigm, known as discrete steepest descent, foralgorithms designed to solve these problems. Sequentialand parallel algorithms for traversing a state space by discretesteepest descent are then analyzed and compared. Theanalysis measures the value (or worth) of a computed solution.The quantity used in the evaluation may be the timerequired by an algorithm to reach the solution, the qualityof the solution obtained, or any similar measure. The valueof a real-time solution obtained in parallel is shown to beconsistently superior to that of a solution computed sequentiallyby an amount superlinear in the size of the problem.
Cost-driven vertical class partitioning for methods in object oriented databases
Authors: Chi-Wai Fung, Kamalakar Karlapalem, Qing Li
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2003)

Abstract.In object-oriented databases (OODBs), a method encapsulated in a class typically accesses a few, but not all the instance variables defined in the class. It may thus be preferable to vertically partition the class for reducing irrelevant data (instance variables) accessed by the methods. Our prior work has shown that vertical class partitioning can result in a substantial decrease in the total number of disk accesses incurred for executing a set of applications, but coming up with an optimal vertical class partitioning scheme is a hard problem. In this paper, we present two algorithms for deriving optimal and near-optimal vertical class partitioning schemes. The cost-driven algorithm provides the optimal vertical class partitioning schemes by enumerating, exhaustively, all the schemes and calculating the number of disk accesses required to execute a given set of applications. For this, a cost model for executing a set of methods in an OODB system is developed. Since exhaustive enumeration is costly and only works for classes with a small number of instance variables, a hill-climbing heuristic algorithm (HCHA) is developed, which takes the solution provided by the affinity-based algorithm and improves it, thereby further reducing the total number of disk accesses incurred. We show that the HCHA algorithm provides a reasonable near-optimal vertical class partitioning scheme for executing a given set of applications.
TSP: Mining Top-K Closed Sequential Patterns
Authors: Petre Tzvetkov, Xifeng Yan, Jiawei Han
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Sequential pattern mining has been studied extensivelyin data mining community.Most previous studies requirethe specification of a minimum support threshold to performthe mining.However, it is difficult for users to providean appropriate threshold in practice.To overcomethis difficulty, we propose an alternative task: mining top-kfrequent closed sequential patterns of length no less thanmin_l, where k is the desired number of closed sequentialpatterns to be mined, and min_l is the minimum length ofeach pattern.We mine closed patterns since they are compactrepresentations of frequent patterns.We developed an efficient algorithm, called TSP, whichmakes use of the length constraint and the properties of top-kclosed sequential patterns to perform dynamic support-raisingand projected database-pruning.Our extensive performancestudy shows that TSP outperforms the closed sequentialpattern mining algorithm even when the latter isrunning with the best tuned minimum support threshold.
Task attribute-based scheduling: extending Ada's support for scheduling
Authors: A. Burns, A. J. Wellings
Venue: ACM SIGAda Ada Letters (2003)

Scheduling policies are of crucial importance to realtime systems. Ada currently gives full support to the most popular policy, fixed priority dispatching. In this paper we argue that the language should be extended to support new paradigms such as Earliest Deadline First (EDF), and combined paradigms. Possible extensions to the language in the form of new pragmas are described.
Virtual reality visualization for maps of the future
Authors: Alan Saalfeld, J. Raul Ramirez
Venue:  (2003)

In today's Geographic Information Systems (GIS) and Computer-Assisted Maps, user's perceptual interface with a paper map is replaced, in many cases, by the analytical and logical queries of a spatial database that represents the map in a computer form. The analytical results do not give a full account of the information that can be represented since these results do not include the implicit information contained in the map. The visual display representation of the entire map is very important for the user to determine what kind of information is to be extracted and to understand the interrelations among elements of the map. Current visualization techniques (paper maps and their computer replicas) do not take full advantage of the many modalities of human perception in representing the complete possible range of spatial information. This research investigates the use of virtual reality (VR) in map visualization and reconsiders some of the fundamental concepts of cartography in the context of the VR advances. Our investigation of spatial cognition shows that VR techniques enhance the perception of spatial phenomena in maps. Three-dimensional object visualization and terrain representation are means to increase the level of perception of the real world in maps. Spatial sound techniques used to enhance the perception of real world phenomena and describe cartographic features are considered important additions to the visual representation in a VR map. Dynamic visualization is used to display real world phenomena (like clouds, rain and movement of the cars and rivers) and to attract the map user's attention. Important cartographic elements such as georeferencing, scale and symbolization are reformulated in the context of VR map visualization. User interaction with the VR map environment enhances the feeling of the realistic presence within the surroundings. Intelligent VR map visualization improves the perception of spatial phenomena through visual representation of GIS queries and analysis. In all, then, this project aims at setting the framework for building an &ldquo;virtual perceptual reality&rdquo; for mapping environments. This will allow us to immerse users into the mapped entities in realistic ways using somewhat conventional desktop computers.
Gender and its relationship to perception in computer-mediated communication
Authors: Diane Mittermeyer
Venue:  (2002)

The growth of computer-mediated communication (CMC) has generated great interest among researchers. Although perspectives vary, the anonymity inherent in textual communication and the reduction of social markers are often described as the characteristics that distinguish CMC from other forms of communication. These arguments have resulted in unprecedented optimism regarding the potential of this technology to eliminate social inequalities and increase access to institutional power. While critics have provided substantial evidence to the contrary, especially in regards to gender inequalities, CMC continues to be promoted and accepted. Critical responses on the issue of gender have concentrated on behavioral issues. As exemplified by the work of Herring, these issues include, among others, the use of adversarial rhetorical strategies, topical control, representation in electronic communities, and the phenomenon known as &ldquo;flaming&rdquo;. Surprisingly, no effort has been made to address the role of gender in the cognitive aspects of CMC or directly question the claims advanced by supporters of this technology in relation to the anonymity of electronic texts. With the exception of Herring's peripheral remarks on this issue and limited work on the problem of gender judgements by Savicki and his colleagues, research is non-existent. Given the importance of this area for the information professions, this research explores the role of gender in the cognitive processes associated with identification and impression formation. More specifically, this research addresses two concerns. The first is whether CMC users can identify the gender of those they have never met face-to-face by relying exclusively on the detection of gender cues. The second centers on the role of gender in the evaluation of electronic communicators. Against the perspectives outlined in the feminist critique of technology, this research's theoretical framework is derived from the work of Hymes as well as literature from cognate fields. Thus, Hymes' theoretical model on the concept of communicative competence, which allows competent speakers to pass judgement on the appropriateness of linguistic events, is central to the investigation. The results provide convincing evidence regarding the implications of gender in the cognitive dimension of CMC. Data from 133 research participants (91 females and 42 males) associated with the study of librarianship or its professional practice suggest that CMC simply recreates existing gender asymmetries. Women are less likely to remain anonymous, more likely to be described stereotypically, and more likely to be evaluated negatively.
MAAN: A Multi-Attribute Addressable Network for Grid Information Services
Authors: Min Cai, Martin Frank, Jinbo Chen, Pedro Szekely
Venue: Proceedings of the 4th International Workshop on Grid Computing (2003)

Recent structured Peer-to-Peer (P2P) systems such asDistributed Hash Tables (DHTs) offer scalable key-basedlookup for distributed resources. However, they cannot besimply applied to grid information services because gridresources need to be registered and searched using multipleattributes. This paper proposes a Multi-Attribute AddressableNetwork (MAAN) which extends Chord to supportmulti-attribute and range queries. MAAN addresses rangequeries by mapping attribute values to the Chord identifierspace via uniform locality preserving hashing. It uses aniterative or single attribute dominated query routing algorithmto resolve multi-attribute based queries. Each nodein MAAN only has O(log N) neighbors for N nodes. Thenumber of routing hops to resolve a multi-attribute rangequery is O(log N + N × smin, where smin is the minimumrange selectivity on all attributes. When smin = \varepsilon, it islogarithmic to the number of nodes, which is scalable to alarge number of nodes and attributes. We also measured theperformance of our MAAN implementation and the experimentalresults are consistent with our theoretical analysis.
PL-detective: a system for teaching programming language concepts
Authors: Amer Diwan, William M. Waite, Michele H. Jackson
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

The educational literature recognizes that people go through a number of stages in their intellectual development. During the first stage, called received knowledge or dualism, people expect knowledge to be handed to them by authority figures (thus "received") and think in terms of black and white (thus "dualism"). Our experience indicates that many computer science students are at this first stage of learning. To help students move beyond this stage, we describe a system and strategy, the PL-detective, to be used in a "concepts of programming languages" course. Assignments using this system directly confront students with the notion that there are often multiple equally good answers and that discussion with students (rather than asking the instructor) is an effective way of learning how to reason.
The Influence of Futures Markets on Real Time Price Stabilization in Electricity Markets
Authors: David Watts, Fernando L. Alvarado
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

Markets can interact with power systems in ways that can render an otherwise stable market and an otherwise stable power system into an unstable overall system. This unstable system will be characterized not only by fluctuating prices that do not settle to constant values, but, more worrisome, it creates the possibility of inducing slow electromechanical oscillations if left unchecked. This will tend to happen as a result of "price chasing" on the part of suppliers that can react (and over-react) to changing system prices. This paper examines the role that futures markets may have on the clearing prices and on altering the volatility and potential instability of real time prices and generator output.
Area-Time Efficient Sign Detection Technique for Binary Signed-Digit Number System
Authors: T. Srikanthan, S. K. Lam, Mishra Suman
Venue: IEEE Transactions on Computers (2004)

Abstract--Computer arithmetic operations based on the BSD (Binary Signed-Digit) number representation system lend themselves well to high-speed computations due to the facilitation of limited carry addition/subtraction. In this paper, we propose an area-time efficient method for sign detection in a BSD number system based on optimized reverse tree structure. When compared to other popular approaches, such as the Most Significant Carry detection-based CLA (Carry Look-Ahead) and MRC (Multilevel Reverse Carry) implementations, the proposed method is superior to both area and time costs in VLSI. Synthesis results for different word lengths show that the proposed approach to sign detection in the BSD number system continues to maintain its advantage over area and time measures.
On image auto-annotation with latent space models
Authors: Florent Monay, Daniel Gatica-Perez
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Image auto-annotation, i.e., the association of words to whole images, has attracted considerable attention. In particular, unsupervised, probabilistic latent variable models of text and image features have shown encouraging results, but their performance with respect to other approaches remains unknown. In this paper, we apply and compare two simple latent space models commonly used in text analysis, namely Latent Semantic Analysis (LSA) and Probabilistic LSA (PLSA). Annotation strategies for each model are discussed. Remarkably, we found that, on a 8000-image dataset, a classic LSA model defined on keywords and a very basic image representation performed as well as much more complex, state-of-the-art methods. Furthermore, non-probabilistic methods (LSA and direct image matching) outperformed PLSA on the same dataset.
Efficient Mining of Frequent Subgraphs in the Presence of Isomorphism
Authors: Jun Huan, Wei Wang, Jan Prins
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

Frequent subgraph mining is an active research topic inthe data mining community. A graph is a general modelto represent data and has been used in many domains likecheminformatics and bioinformatics. Mining patterns fromgraph databases is challenging since graph related operations,such as subgraph testing, generally have higher timecomplexity than the corresponding operations on itemsets,sequences, and trees, which have been studied extensively.In this paper, we propose a novel frequent subgraph miningalgorithm: FFSM, which employs a vertical search schemewithin an algebraic graph framework we have developedto reduce the number of redundant candidates proposed.Our empirical study on synthetic and real datasets demonstratesthat FFSM achieves a substantial performance gainover the current start-of-the-art subgraph mining algorithmgSpan.
Automatic identification of best entry points for focused structured document retrieval
Authors: Mounia Lalmas, Jane Reid
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Focussed structured document retrieval employs the concept of best entry points (BEPs), which are intended to provide optimal starting-points from which users can browse to relevant document components. This paper describes two small-scale studies, using experimental data from the Shakespeare user study, which developed and evaluated different approaches to the problem of automatic identification of BEPs.
Control Constrained Resource Partitioning for Complex SoCs
Authors: Dan Zhao, Shambhu Upadhyaya, Martin Margala
Venue: Proceedings of the 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2003)

When moving into the billion-transistor era, the wired interconnects used in conventional SoCtest control models are rather restricted in not only system performance, but also signal integrityand transmission with continued scaling of feature size. On the other hand, recent advances in silicon integrated circuit technology are making possible tiny low-cost transceivers to be integrated on chip. Based on the recent development in "radio-on-chip" technology, a new distributed multihop wireless test control network has been proposed. Under the multilevel tree structure, the system optimization is performed on control constrained resource partitioning and distribution. Several system design issues such as radio-frequency nodes placement, clustering and routing problems are studied, with the integrated resource distribution including not only the circuit blocks to perform testing, but also the on-chip radio-frequency nodes for intra-chip communication.