ppxscal/embedding_network huggingface dataset:
Non-stationary multiple-antenna interference cancellation for unsynchronized OFDM systems with distributed training
Authors: Alexandr M. Kuzminskiy, Yuri I. Abramovich
Venue: Signal Processing (2009)

Adaptive interference cancellation is addressed in an asynchronous orthogonal frequency-division multiplexing (OFDM) system with a frame containing a number of temporally distributed pilot symbols, e.g., as in the IEEE 802.16-2004 standard. Non-stationary symbol-by-symbol switching technique is proposed that is based on banks of the second-order statistics semi-blind solutions with on-line algorithm selection using a higher-order statistics criterion. Three banks of algorithms are formulated and analyzed by means of comparison to the conventional stationary pilot-based solution and to the non-asymptotic maximum-likelihood benchmark especially developed for assessment of the proposed interference cancellation algorithms. Their efficiency is compared to the conventional stationary solutions by means of simulations in a WiMAX (worldwide interoperability for microwave access) environment.
On the pseudo-achromatic number problem
Authors: Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang
Venue: Theoretical Computer Science (2009)

We study the parameterized complexity of the pseudo-achromatic number problem: Given an undirected graph and a parameter k, determine if the graph can be partitioned into k groups such that every two groups are connected by at least one edge. This problem has been extensively studied in graph theory and combinatorial optimization. We show that the problem has a kernel of at most (k-2)(k+1) vertices that is constructable in time O(mn), where n and m are the number of vertices and edges, respectively, in the graph, and k is the parameter. This directly implies that the problem is fixed-parameter tractable. We also study generalizations of the problem and show that they are parameterized intractable.
Reverse Vgs Static CMOS (RVGS-SCMOS); A New Technique for Dynamically Compensating the Process Variations in Sub-threshold Designs
Authors: Bahman Kheradmand Boroujeni, Christian Piguet, Yusuf Leblebici
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

In this work we present a new static circuit topology for sub-threshold (sub-VT) digital design. Proposed topology is derived from SCMOS but modifications are done to introduce new adjustable parameters to provide about 4X more control on the delay and active-mode leakage of gates. Proposed gates have full-swing input and output signaling but when the internal NMOS/PMOS transistors are off, they have negative Vgs/Vsg bias, respectively. By controlling the amount of these reverse biases, we can compensate process and temperature variations. Proposed method can be applied to any device or technology node and has 20% area and delay overheads.
Mobility-aware management of internet connectivity in always best served wireless scenarios
Authors: Paolo Bellavista, Antonio Corradi, Carlo Giannelli
Venue: Mobile Networks and Applications (2009)

The widespread availability of portable devices with multiple wireless interfaces, e.g., IEEE 802.11, WiMAX, Bluetooth, and/or UMTS, is leveraging the potential of novel supports to seamlessly and automatically select the proper connectivity technology to exploit at any time for any node and any running application. That selection should be context-dependent and take into account several aspects, at very different abstraction layers, from application-specific bandwidth requirements to expected client mobility, from user preferences to energy consumption. We claim the suitability of mobility-aware middlewares to relieve the application logic from the burden of determining the most suitable interface and connectivity provider for each client/application at service provisioning time. In particular, the paper motivates the need for novel context indicators, e.g., client/connector relative mobility, and describes effective lightweight solutions to estimate them flexibly, depending on dynamically introduced evaluation metrics. The paper presents primary architecture and implementation guidelines to build such a novel middleware solution. The proposed middleware has been experimentally validated and the reported performance results demonstrate the feasibility of the approach: it achieves accurate estimations of node mobility and consequently performs connection establishment/selection with very limited overhead.
The optimal stopping times of American call options
Authors: Guangqin Li
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

American options can be exercised at any time during their lifetime. This paper addresses the optimal stopping time of several kinds of American call options.
Living interfaces: the impatient toaster
Authors: Eva Burneleit, Fabian Hemmert, Reto Wettach
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

This paper introduces the Impatient Toaster, a kitchen appliance designed to motivate its owners to eat more often and in regular intervals: After not using it for a while, it signalizes hunger through nervous movements. This project sought to explore life-like behaviour as a means of increasing user's sympathy for everyday objects. We present a prototype that was informally tested with six participants in a situated user test. The results indicate that sympathy and perceived cuteness can arise from life-like movements that, as we propose, represent an object's will of its own. This work is part of a larger series of experiments in the Living Interfaces project, exploring ways in which reduced life-like movements can be beneficial for Human-Machine Interaction.
A Quality Based Motion Estimation Criterion for Temporal Coding of Video
Authors: Ravindra Kumar Purwar, Nupur Prakash, Navin Rajpal
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

In video compression, motion compensation techniques are used for removal of temporal redundancy and it is the block based matching concept which is most popular among them. In such matching techniques, Mean Absolute Difference (MAD) is widely accepted as the matching criterion because of its simplicity and low computation. Since MAD considers only average error value in a block for matching purposes while ignoring individual difference between the pixels, the matching may not be more accurate. In this paper, a new block matching criterion is being suggested and is experimentally compared with two other matching criterions including MAD, using four parameters and the results are better for the proposed one.
A dynamic crashing method for project management using simulation-based optimization
Authors: Michael E. Kuhl, Radhamés A. Tolentino-Peña
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

A dynamic simulation-based crashing method is introduced in this research to evaluate project networks and determine the optimum crashing configuration that minimizes the average project cost due to lateness penalties and crashing costs. This dynamic approach will let the user evaluate the project network to determine a crashing strategy at the beginning of the project and also during the life of the project. By reevaluating the project network possible adjustments to the crashing strategy may be identified and implemented. The output of the method includes a distribution of the project completion time, a distribution of the project total cost, and the project cost savings.
Research Article: Structural adaptation of the subunit interface of oligomeric thermophilic and hyperthermophilic enzymes
Authors: Elisa Maugini, Daniele Tronelli, Francesco Bossa, Stefano Pascarella
Venue: Computational Biology and Chemistry (2009)

Enzymes from thermophilic and, particularly, from hyperthermophilic organisms are surprisingly stable. Understanding of the molecular origin of protein thermostability and thermoactivity attracted the interest of many scientist both for the perspective comprehension of the principles of protein structure and for the possible biotechnological applications through application of protein engineering. Comparative studies at sequence and structure levels were aimed at detecting significant differences of structural parameters related to protein stability between thermophilic and hyperhermophilic structures and their mesophilic homologs. Comparative studies were useful in the identification of a few recurrent themes which the evolution utilized in different combinations in different protein families. These studies were mostly carried out at the monomer level. However, maintenance of a proper quaternary structure is an essential prerequisite for a functional macromolecule. At the environmental temperatures experienced typically by hyper- and thermophiles, the subunit interactions mediated by the interface must be sufficiently stable. Our analysis was therefore aimed at the identification of the molecular strategies adopted by evolution to enhance interface thermostability of oligomeric enzymes. The variation of several structural properties related to protein stability were tested at the subunit interfaces of thermophilic and hyperthermophilic oligomers. The differences of the interface structural features observed between the hyperthermophilic and thermophilic enzymes were compared with the differences of the same properties calculated from pairwise comparisons of oligomeric mesophilic proteins contained in a reference dataset. The significance of the observed differences of structural properties was measured by a t-test. Ion pairs and hydrogen bonds do not vary significantly while hydrophobic contact area increases specially in hyperthermophilic interfaces. Interface compactness also appears to increase in the hyperthermophilic proteins. Variations of amino acid composition at the interfaces reflects the variation of the interface properties.
IPv6@HOME
Authors: Kuljaree Tantayakul, Sinchai Kamolphiwong, Touchai Angchuan
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

This paper presents a practical approach to connecting a home network to the IPv6 world. A number of connection methods have been proposed and deployed, some suitable for a rich network environment, e.g. enterprise networks. Home networks are particularly significant due to the large number of sites. Home networks are connected via a wide variety of access technologies, e.g. xDSL, broadband, FTTH, however in general these all use IPv4 only. Due to the shortage of IPv4 addresses, and the way they are allocated to home users by service providers, there can be problems with traditional method of transitional IPv6 connectivity. For example, v4 addresses assigned are often changed frequently, whereas other providers use NAT and do not allocate global addresses at all. In this paper we examine those problems and suggest a possible method to connect a home IPv6 network by implementing existing transition mechanisms in the home gateway. We also propose an easy way to access all devices by interoperating with IPv6 Dynamic Domain Name Service (DDNSv6). The solution is simply and has a low implementation cost.
A note on the lower bound of edge guards of polyhedral terrains
Authors: Prosenjit Bose
Venue: International Journal of Computer Mathematics (2009)

Bose et al. [P. Bose et al., Guarding polyhedral terrains, Comput. Geom., Theory Appl. 6 (1997), pp. 173-185.] proved that ⌊ (4n-4)/13 ⌋ edge guards are sometimes necessary to guard an n-vertex polyhedral terrain. Subsequently, Kaucic et al. [B. Kaucic, B. Zalik, and F. Novak, On the lower bound of edge guards of polyhedral terrains, Int. J. Comput. Math. 80 (2003), pp. 811-814.] claimed to find an inconsistency in the proof and used Bose et al. 's proof technique to prove a weaker lower bound of ⌊ (2n-4)/7 ⌋ edge-guards. They declared that a proof of the original lower bound of ⌊ (4n-4)/13 ⌋ remains an open issue. The purpose of this note is simply to point out that the issue is not open and that Bose et al. 's original proof is correct. We present the original proof of ⌊ (4n-4)/13 ⌋ at a level of detail to hopefully remove any misunderstanding of the result.
Algebras on subintervals of pseudo-hoops
Authors: Lavinia Corina Ciungu
Venue: Fuzzy Sets and Systems (2009)

If A is a bounded R@?-monoid or a pseudo-BL algebra, then it was proved that a subinterval [a,b] of A can be endowed with a structure of an algebra of the same kind as A. Similar results were obtained if A is a residuated lattice and a,b belong to the Boolean center of A. Given a bounded pseudo-hoop A, in this paper we will give conditions for a,b@?A for the subinterval [a,b] of A to be endowed with a structure of a pseudo-hoop. We will introduce the notions of Bosbach and Riecan states on a pseudo-hoop, we study their properties and we prove that any Bosbach state on a good pseudo-hoop is a Riecan state. For the case of a bounded Wajsberg pseudo-hoop we prove that the two states coincide. We also study the restrictions of Bosbach states on subinterval algebras of a pseudo-hoop.
FOGGER: an algorithm for graph generator discovery
Authors: Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
Venue: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology (2009)

To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators which are preferable to the closed subgraphs according to the Minimum Description Length principle in some applications. In this paper, we study a new problem of frequent subgraph mining, called frequent connected graph generator mining, which poses significant challenges due to the underlying complexity associated with frequent subgraph mining as well as the absence of Apriori property for graph generators. Whereas, we still present an efficient solution FOGGER for this new problem. By exploring some properties of graph generators, two effective pruning techniques, backward edge pruning and forward edge pruning, are proposed to prune the branches of the well-known DFS code enumeration tree that do not contain graph generators. To further improve the efficiency, an effective index structure, ADI++, is also devised to facilitate the subgraph isomorphism checking. We experimentally evaluate various aspects of FOGGER using both real and synthetic datasets. Our results demonstrate that the two pruning techniques are effective in pruning the unpromising parts of search space, and FOGGER is efficient and scalable in terms of the base size of input databases. Meanwhile, the performance study for graph generator-based classification model shows that generator-based model is much simpler and can achieve almost the same accuracy for classifying chemical compounds in comparison with closed subgraph-based model.
A note on workload control for an under-utilized server of M/G/1 system
Authors: Zhe George Zhang
Venue: Computers and Industrial Engineering (2009)

In this note, we study the issue of adjusting the workload of an under-utilized server in a queueing system. Using an M/G/1 model with server vacations of two types, we can effectively control the workload level of the server. The server vacations are time periods that the server does not serve the queue. Type 1 vacations represent durations of supplementary non-queue jobs assigned to the server. Type 2 vacations represent the non-productive period for the server such as idle time. With a two threshold policy, we demonstrated that the server's workload can be effectively controlled. A simple procedure for determining the conditionally optimal policy is proposed. Numerical examples are presented to illustrate the use of the procedure.
Point of View - An Experiment in Linear Hypervideo
Authors: Guy Vardi, Roni Shaliv, Guy Vardi
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The article describes a prototype that implements a new model for interactive movie viewing. The demo contains a short movie that was filmed from several points of view. The user can choose the angle from which he would like to watch the movie by selecting an appropriate link. The user's selections do not interfere with the development of the narrative. The plot and the previous selections determine the availability of further navigation options. The narrative and the correlation between the characters and the links serve as guide line during the navigation. The interactive dimension of the project affect some of the cinematic conventions of the movie, without changing the traditional structure of the narrative.
The bio-zen plus ontology
Authors: Matthias Samwald, Klaus-Peter Adlassnig
Venue: Applied Ontology (2008)

Bio-zen plus is an OWL DL ontology for the domain of biomedical research. It incorporates several existing Semantic Web ontologies: the DOLCE foundational ontology, the Simple Knowledge Organisation System (SKOS), the Semantically Interlinked Online Communities ontology (SIOC), FOAF ontology, the Dublin Core metadata schema and the Creative Commons Metadata schema. The contents of many biomedical taxonomies and ontologies are available as extension packages. Bio-zen plus is the first ontology in the domain of life sciences that is optimized for practical use on the Semantic Web and makes extensive use of existing Semantic Web ontologies.
A secure and anonymous voter-controlled election scheme
Authors: Thomas E. Carroll, Daniel Grosu
Venue: Journal of Network and Computer Applications (2009)

Despite the massive improvements in technology the goal of having accurate, anonymous and voter-verifiable elections has not yet been realized. The existing electronic voting schemes that provide secret voter-verifiable receipts are based on ''classical'' mix-nets. These mix-nets approaches do not scale well and are designed to provide a fixed degree of anonymity which cannot be increased by the voters who do not trust the system. In this paper we propose a new voting scheme that allows the voters to increase their degree of anonymity beyond the one implicitly provided by the system and provides secret voter-verifiable receipts. The proposed scheme utilizes incoercible, voter-verifiable receipts. The scheme is robust as no reasonable-sized coalition can interfere with the correct operation. The scheme has low communication complexity and thus it is efficient to use in large scale elections.
A decision support system for improving doctors' prescribing behavior
Authors: Chinho Lin, Chun Mei Lin, Binshan Lin, Ming-Chin Yang
Venue: Expert Systems with Applications: An International Journal (2009)

The study adopts a well-defined game theory with a decision support system (DSS) to embed the critical factors involved in coordination game equilibrium. A data-warehouse-based DSS is used as a coordinating instrument along with the disclosure of quality report cards. Feedback on prescribing, giving information on aggregated data, along with the DSS, could be sufficient to improve prescribing behavior. The aim of this study was to apply a DSS with pre-play communication of the coordination game theory to the improvement of doctors' antibiotic prescribing behavior. We examined whether the DSS improved the prescribing behavior, and assessed how well the participating doctors improved quality of care. We found the group using the system had a greater decrease in antibiotic prescription than the non-DSS group. This study concluded that the DSS with game-theory modeling has made significant contributions for improving the doctors' prescribing behavior. Future research directions and managerial implications are addressed as well.
Prelude to Programming: Concepts and Design (4th Edition), 4 edition
Authors: Stewart Venit, Elizabeth Drake
Venue:  (2008)

Beginning programmers struggle constantly to balance logic and syntax. Written in a non-language specific format, Prelude to Programming,4/e, addresses this problem, giving beginners a language-independent framework for learning core programming concepts and effective design techniques. Gives readers the foundation they need to understand the logic behind program design and to establish effective programming skills. Focuses on many different languages, but includes real problems that mirror the pseudocode problems throughout, in four programming languages (Java, C++, VisualBasic, and Python). Is packaged with the RAPTOR flow-charting software complimentary software that enables users to write programs without worrying about syntax providing a hands-on component without the need to learn a whole programming language. Includes new What and Why sections that discuss what would happen if the program were run, or something were changed. Provides new Making It Work boxed features throughout, discussing how to implement concepts in an actual high-level language. Updates Focus on Problem Solving sections. A useful basic reference for programmers.
Engineering the social: The role of shared artifacts
Authors: Jeni Paay, Leon Sterling, Frank Vetere, Steve Howard, Anne Boettcher
Venue: International Journal of Human-Computer Studies (2009)

This paper presents a multidisciplinary approach to engineering socio-technical design. The paper addresses technological design for social interactions that are non-instrumental, and thereby sometimes contradictory or surprising and difficult to model. Through cooperative analysis of cultural probe data and development of agent-oriented software engineering (AOSE) models, ethnographers and software engineers participate in conversations around shared artifacts, which facilitate the transition from data collected in a social environment to a socially oriented requirements analysis for informing socio-technical design. To demonstrate how this transition was made, we present a case study of the process of designing technology to support familial relationships, such as playing, gifting, showing, telling and creating memories. The case study is based on data collected in a cultural probes study that explores the diverse, complex and unpredictable design environment of the home. A multidisciplinary team worked together through a process of conversations around shared artifacts to cooperatively analyze collected data and develop models. These conversations provided the opportunity to view the data from the perspective of alternative disciplines that resulted in the emergence of novel understandings and innovative practice. The artifacts in the process included returned probe items, scrapbooks, videos of interviews, photographs, family biographies and the AOSE requirements models. When shared between the two communities of practice, some of these artifacts played important roles in mediating discussions of mutual influence between ethnographers and software engineers. The shared artifacts acted as both triggers for conversations and information vessels-providing a variety of interpretable objects enabling both sides to articulate their understandings in different ways and to collaboratively negotiate understandings of the collected data. Analyzing the interdisciplinary exchange provided insight into the identification of bridging elements that allowed 'the social' to permeate the processes of analysis, requirements elicitation and design.