ppxscal/embedding_network huggingface dataset:
Estimating Software Cost Contingency Using Options Theory
Authors: Said Boukendour
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

This paper aims to estimate the project cost contingency regardless the individual utility function and risk aversion. Considering a project alike a short selling, the option pricing theory is used to value the contingency as a risk premium that would be required by the market if the project was a traded security.
A language for expressing user-context preferences in the web
Authors: Juan Ignacio Vázquez, Diego López de Ipińa
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

In this paper, we introduce WPML (WebProfiles Markup Language) for expressing user-context preferences information in the Web. Using WPML a service provider can negotiate and obtain user-related information to personalise service experience without explicit manual configuration by the user, while preserving his privacy using P3P.
New approaches to advising and mentoring in science and technology
Authors: Carol Binkerd, John D. Fernandez
Venue: Journal of Computing Sciences in Colleges (2004)

In this fast-paced world of daily technological innovations, university students are caught up in a treadmill of activities, functions, deadlines, finances, and academic challenges. This is particularly difficult for first and second-year students who have to modify their high school habits and create new habits, especially if pursuing a degree in the sciences or an associated technology field. Because of the results of the University's Noel-Levitz survey, a new advising and mentoring model was formulated. This paper describes the new approaches to advising and mentoring implemented at Texas A&M University-Corpus Christi (TAMU-CC) and the successes achieved.
Uncovering Database Access Optimizations in the Middle Tier with TORPEDO
Authors: Bruce E. Martin
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

A popular architecture for enterprise applications is one of a stateless object-based server accessing persistent data through Object-Relational mapping software. The reported benefits of usingObject-Relational mapping software are increased developer productivity, greater database portability and improved runtime performance over hand-written SQL due to caching. In spite of these supposed benefits, many software architects are suspicious of the "black box" nature of O-R mapping software. Discerning how O-R mapping software actually accesses a database is difficult. The Testbed of Object Relational Products for Enterprise Distributed Objects (TORPEDO) is designed to reveal the sophistication of O-R mapping software in accessing databases in single server and clustered environments. TORPEDO defines a set of realistic application level operations that detect significant set of database access optimizations. TORPEDO supports two standard Java APIs for O-R mapping, namely, Container Managed Persistence (CMP 2.0) and Java Data Objects (JDO). TORPEDO also supports the TopLink and Hibernate APIs. There are dozens of commercial and open-source O-R mapping products supporting these APIs. Results from running TORPEDO on different O-R mapping systems are comparable. We provide sample results from running TORPEDO on popular O-R mapping solutions. We describe why the optimizations TORPEDO reveals are important and how the application level operations detect the optimizations
Who gets to know what when: configuring privacy permissions in an awareness application
Authors: Sameer Patil, Jennifer Lai
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

We report on a study (N=36) of user preferences for balancing awareness with privacy. Participants defined permissions for sharing of location, availability, calendar information and instant messaging (IM) activity within an application called mySpace. MySpace is an interactive visualization of the physical workplace that provides dynamic information about people, places and equipment. We found a significant preference for defining privacy permissions at the group level. While "family" received high levels of awareness sharing, interestingly, "team" was granted comparable levels during business hours at work. Surprisingly, presenting participants with a detailed list of all pieces of personal context to which the system had access, did not result in more conservative privacy settings. Although location was the most sensitive aspect of awareness, participants were comfortable disclosing room-level location information to their team members at work. Our findings suggest utilizing grouping mechanisms to balance privacy control with configuration burden, and argue for increased system transparency to build trust.
Range Data Registration Using Photometric Features
Authors: Joon Kyu Seo, Gregory C. Sharp, Sang Wook Lee
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

This paper investigates the use of photometric features for the pair-wise registration of range images. Many artificial and natural objects exhibit abundant surface texture that may not be revealed in range data, and most structured light and laser range sensors are capable of capturing either grayscale or color photometric intensity in addition to range data. Nevertheless, the use of photometric features has not been widely investigated for range data registration, despite widespread research into local feature descriptors for object recognition in 2D photometric images. This paper addresses some of the problems that arise in using photometric features for range data registration, and presents a systematic method for their use. Potentially useful photometric features are detected on planar regions in 3D, and then reprojected to 2D to remove the perspective distortion. Then, a well-established 2D rotation- and brightness-invariant image feature descriptor is used for matching. Range data alignment is performed using a RANSAC algorithm, with verification performed in 3D. Experimental results demonstrate the effectiveness of this method.
The Aphasia project: designing technology for and with individuals who have aphasia
Authors: Karyn Moffatt, Rhian Davies
Venue: Issue 80 (September 2004) (2004)

The Aphasia Project is a multi-disciplinary research project spanning computer science, psychology, and speech-language pathology, investigating how technology can be designed to support individuals with aphasia in their daily life. Aphasia is a cognitive disorder affecting approximately 100,000 individuals in Canada and 1 million people in the United States [1]. It is usually acquired as a result of stroke, brain tumor, or other brain injury, and results in impairment to the production and/or comprehension of spoken and/or written language. Rehabilitation can reduce the level of impairment and mitigate its impact, but a significant number of individuals are left with a life-long chronic disability that influences a wide range of activities and prevents full re-engagement in life. The long-term impact of aphasia varies across individuals; however, given the importance of language communication in virtually all aspects of daily life, it is not surprising that most, if not all, individuals experience a reduction in their ability to participate in everyday activities, with the result that social isolation and depression are relatively common.
Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0--1 knapsack problem
Authors: D. El Baz, M. Elkihel
Venue: Journal of Parallel and Distributed Computing (2005)

The parallelization on a supercomputer of a one list dynamic programming algorithm using dominance technique and processor cooperation for the 0-1 knapsack problem is presented. Such a technique generates irregular data structure, moreover the number of undominated states is unforeseeable. Original and efficient load balancing strategies are proposed. Finally, computational results obtained with an Origin 3800 supercomputer are displayed and analyzed. To the best of our knowledge, this is the first time for which computational experiments on a supercomputer are presented for a parallel dynamic programming algorithm using dominance technique.
Back to the future: a look at recursive binary trees
Authors: John Beidler, Carolyn Smart
Venue: Journal of Computing Sciences in Colleges (2005)

This paper builds upon the recursive list concepts presented in [Be02] by extending them to recursive binary trees. The authors take a minimalist approach, keeping the methods in a base class to a necessary and sufficient minimum with the hope of reducing the complexity of software that is built upon the base classes. A byproduct of this approach is a demonstration of the value of swap and factory methods.
Bayesian neural networks for nonlinear time series forecasting
Authors: Faming Liang
Venue: Statistics and Computing (2005)

In this article, we apply Bayesian neural networks (BNNs) to time series analysis, and propose a Monte Carlo algorithm for BNN training. In addition, we go a step further in BNN model selection by putting a prior on network connections instead of hidden units as done by other authors. This allows us to treat the selection of hidden units and the selection of input variables uniformly. The BNN model is compared to a number of competitors, such as the Box-Jenkins model, bilinear model, threshold autoregressive model, and traditional neural network model, on a number of popular and challenging data sets. Numerical results show that the BNN model has achieved a consistent improvement over the competitors in forecasting future values. Insights on how to improve the generalization ability of BNNs are revealed in many respects of our implementation, such as the selection of input variables, the specification of prior distributions, and the treatment of outliers.
A Prioritized Information Fusion Method for Handling Fuzzy Decision-Making Problems
Authors: Shi-Jay Chen, Shyi-Ming Chen
Venue: Applied Intelligence (2005)

Although Yager has presented a prioritized operator for fuzzy subsets, called the non-monotonic operator, it can not be used to deal with multi-criteria fuzzy decision-making problems when generalized fuzzy numbers are used to represent the evaluating values of criteria. In this paper, we present a prioritized information fusion algorithm based on the similarity measure of generalized fuzzy numbers. The proposed prioritized information fusion algorithm has the following advantages: (1) It can handle prioritized multi-criteria fuzzy decision-making problems in a more flexible manner due to the fact that it allows the evaluating values of criteria to be represented by generalized fuzzy numbers or crisp values between zero and one, and (2) it can deal with prioritized information filtering problems based on generalized fuzzy numbers.
Cost effective data entry techniques for design automation
Authors: Jerry T. Harvel
Venue: ACM SIGDA Newsletter (1979)

A major problem in automating the design of printed circuit boards and hybrids is an effective method of converting data from engineering documentation into machine readable form. The process is time consuming and error-prone, often representing 30% or more of the total design effort.This paper addresses several methods for capturing data from a schematic or logic diagram, and data entry. Traditional mediums, such as cards and tape, are reviewed. Conventional techniques, such as key-to-disc and key-to-tape are examined, and advanced techniques, such as graphic and voice data entry are also explored. Data conversion from other sources, such as existing wire lists, is also reviewed. The methods, techniques and procedures are investigated in detail. 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
Ranking definitions with supervised learning methods
Authors: Jun Xu, Yunbo Cao, Hang Li, Min Zhao
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

This paper is concerned with the problem of definition search. Specifically, given a term, we are to retrieve definitional excerpts of the term and rank the extracted excerpts according to their likelihood of being good definitions. This is in contrast to the traditional approaches of either generating a single combined definition or simply outputting all retrieved definitions. Definition ranking is essential for the task. Methods for performing definition ranking are proposed in this paper, which formalize the problem as either classification or ordinal regression. A specification for judging the goodness of a definition is given. We employ SVM as the classification model and Ranking SVM as the ordinal regression model respectively, such that they rank definition candidates according to their likelihood of being good definitions. Features for constructing the SVM and Ranking SVM models are defined. An enterprise search system based on this method has been developed and has been put into practical use. Experimental results indicate that the use of SVM and Ranking SVM can significantly outperform the baseline methods of using heuristic rules or employing the conventional information retrieval method of Okapi. This is true both when the answers are paragraphs and when they are sentences. Experimental results also show that SVM or Ranking SVM models trained in one domain can be adapted to another domain, indicating that generic models for definition ranking can be constructed.
Lightweight monitors for the Java virtual machine
Authors: Byung-Sun Yang, Soo-Mook Moon, Kemal Ebcioğlu
Venue: Software&mdash;Practice Experience (2005)

Java supports the monitor construct for language-level synchronization in the context of multi-threading. This paper introduces the lightweight monitor, an efficient user-level monitor implementation. The lightweight monitor is useful for single-threaded Java programs as well as for multi-threaded Java programs with little lock contention. A 32-bit lock is embedded in each object for efficient lock access while other monitor data structures are managed using a hash table. We highly optimized the lock manipulation code, which is translated and inlined by a just-in-time &lpar;JIT&rpar; compiler. In the most probable cases, only nine SPARC instructions are spent for lock acquisition and five instructions are spent for lock release. Our experimental results indicate that the lightweight monitor is faster than the monitor implementation in the SUN JDK 1.2 RC1 by up to 21 times in the absence of lock contention and by up to seven times in the presence of lock contention. Copyright &copy; 2004 John Wiley & Sons, Ltd.This is a revised and expanded version of a paper published in the Third Workshop on Interaction Between Compilers and Computer Architectures, October 1998
XML Views as Integrity Constraints and Their Use in Query Translation
Authors: Rajasekar Krishnamurthy, Raghav Kaushik, Jeffrey F. Naughton
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

The SQL queries produced in XML-to-SQL query translation are often unnecessarily complex, even for simple input XML queries. In this paper we argue that relational systems can do a better job of XML-to-SQL query translation with the addition of a simple new constraint, which we term the "lossless from XML" constraint. Intuitively, this constraint states that a given relational data set resulted from the shredding of an XML document that conformed to a given schema. We illustrate the power of this approach by giving an algorithm that exploits the "lossless from XML" constraint to translate path expression queries into efficient SQL, even in the presence of recursive XML schemas. We argue that this approach is likely to be simpler and more effective than the current state of the art in optimizingXML-to-SQL query translation, which involves identifying and declaring multiple complex relational constraints and then reasoning about relational query containment in the presence of these constraints.
A language for describing the generating structure of the educational material in the individually adaptive learning management system
Authors: Svetoslav Zabunov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

This paper summarizes the structure of a complete Individually adaptive learning management system (IALMS) and defines a formal language for describing the generating structure of the educational material in IALMS. It tends to establish the structural model and functionality characteristics of the Adaptive subsystem of the IALMS model. the generating structure language is explained and fully syntactically defined.
Java After Hours: 10 Projects You'll Never Do at Work
Authors: Steve Holzner
Venue:  (2005)

Take your Java programming skills beyond the ordinary. Java After Hours: 10 Projects You'll Never Do at Work will make Java your playground with ten detailed projects that will have you exploring the various fields that Java offers to build exciting new programs. You'll learn to: Create graphics interactively on Web servers Send images to Web browsers Tinker with Java's Swing package to make it do seemingly impossible things Search websites and send e-mail from Java programs Use multithreading, Ant and more!Increase your Java arsenal by taking control of Java and explore its possibilities with Java After Hours.
In-Order Packet Delivery in Interconnection Networks using Adaptive Routing
Authors: J. C. Martinez, J. Flich, A. Robles, P. Lopez, J. Duato, Michihiro Koibuchi
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Most commercial switch-based network technologies for PC clusters use deterministic routing. Alternatively, adaptive routing could be used to improve network performance. In this case, switches decide the path to reach the destination by using local information about the state of the possible outgoing links. However, there are two drawbacks that discourage adaptive routing from being applied to commercial interconnects. The first one concerns the possible switch complexity increase with respect to deterministic routing. The second drawback is due to the fact that adaptive routing may introduce out-of-order packet delivery, which is not acceptable for some applications. For the best of our knowledge, there are no works that analyze the degree of out-of-order packet delivery caused by different network and traffic conditions. In this paper, we take on such a challenge. We show that only for high traffic conditions (reaching saturation) out-of-order delivery is introduced. Moreover, by using small buffers and simple sorting mechanisms at destination, we show that high network throughput can be obtained at the same time packets are delivered in order. Thus, the paper demonstrates that it is possible to use adaptive routing, while still guaranteeing in-order packet delivery, without using large buffer resources nor degrading significantly its performance.
Minimum energy reliable paths using unreliable wireless links
Authors: Qunfeng Dong, Suman Banerjee, Micah Adler, Archan Misra
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

We address the problem of energy-efficient reliable wireless communication in the presence of unreliable or lossy wireless link layers in multi-hop wireless networks. Prior work [1] has provided an optimal energy efficient solution to this problem for the case where link layers implement perfect reliability. However, a more common scenario --- a link layer that is not perfectly reliable, was left as an open problem. In this paper we first present two centralized algorithms, BAMER and GAMER, that optimally solve the minimum energy reliable communication problem in presence of unreliable links. Subsequently we present a distributed algorithm, DAMER, that approximates the performance of the centralized algorithm and leads to significant performance improvement over existing single-path or multi-path based techniques.
Thermal aware cell-based full-chip electromigration reliability analysis
Authors: Syed M. Alam, Donald E. Troxel, Carl V. Thompson
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

A hierarchical scheme with cells and modules is crucial for managing design complexity during a large integrated circuit design. We present a methodology for thermal aware cell-based electromigration analysis suitable for integrating electromigration reliability analysis into a conventional IC design flow. A block or cell is characterized for reliability while it is characterized for power and timing. Reusing cell characterization data significantly reduces computational load while analyzing a full-chip layout. During full-chip analysis, we compute a layout-level temperature profile from cell power dissipations using a Fast Fourier Transform based algorithm. The described full-chip reliability assessment methodology has been implemented in an interconnect reliability CAD tool. We have exercised the tool to demonstrate performance-reliability tradeoff and the significance of thermal-aware reliability analysis for true reliability aware design.
A New Segmentation Algorithm for Low Quality Fingerprint Image
Authors: Zhongchao Shi, Yangsheng Wang, Jin Qi, Ke Xu
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Aiming at the segmentation of low quality fingerprint images, a new framework, which is different from traditional methods that usually use some certain features to segment diversified images, is proposed. There are two contributions in this scheme: firstly, we introduce a quality estimation step before segmentation, which can remove a great many false traces effectively; secondly, a new feature Eccentric Moment is proposed to locate the blurry boundary. Then we segment the image using the new block feature of clarified image. Experimental results show that the proposed method can segment low quality fingerprint images properly.
A Formal Approach to Requirements-Based Programming
Authors: Michael G. Hinchey, James L. Rash, Christopher A. Rouff
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

No significant general-purpose method is currently available to mechanically transform system requirements into a provably equivalent model. The widespread use of such a method represents a necessary step toward high-dependability system engineering for numerous application domains. Current tools and methods that start with a formal model of a system and mechanically produce a provably equivalent implementation are valuable but not sufficient. The "gap" unfilled by such tools and methods is that the formal models cannot be proven to be equivalent to the requirements. We offer a method for mechanically transforming requirements into a provably equivalent formal model that can be used as the basis for code generation and other transformations. This method is unique in offering full mathematical tractability while using notations and techniques that are well known and well trusted. Finally, we describe further application areas we are investigating for use of the approach.