ppxscal/embedding_network huggingface dataset:
Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem
Authors: S. Q. Liu, H. L. Ong, K. M. Ng
Venue: Advances in Engineering Software (2005)

For the shop scheduling problems such as flow-shop, job-shop, open-shop, mixed-shop, and group-shop, most research focuses on optimizing the makespan under static conditions and does not take into consideration dynamic disturbances such as machine breakdown and new job arrivals. We regard the shop scheduling problem under static conditions as the static shop scheduling problem, while the shop scheduling problem with dynamic disturbances as the dynamic shop scheduling problem. In this paper, we analyze the characteristics of the dynamic shop scheduling problem when machine breakdown and new job arrivals occur, and present a framework to model the dynamic shop scheduling problem as a static group-shop-type scheduling problem. Using the proposed framework, we apply a metaheuristic proposed for solving the static shop scheduling problem to a number of dynamic shop scheduling benchmark problems. The results show that the metaheuristic methodology which has been successfully applied to the static shop scheduling problems can also be applied to solve the dynamic shop scheduling problem efficiently.
Explicitly and implicitly teaching Java best practices across the undergraduate curriculum
Authors: Joel Hollingsworth, David J. Powell
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

In 2001, The Joint Task Force on Computing Curricula defined model curricula for a computer science undergraduate that specified the core learning units that a student should take over a four year period. The authors have found that the use of a single, state of the art, interactive development environment across these curricula can both explicitly and implicitly continually teach Java best practices. The net result is a graduating student who can productively step into an entry level computer science position.
Motion capture from demonstrator's viewpoint and its application to robot teaching
Authors: Yasuyoshi Yokokohji, Yuki Kitaoka, Tsuneo Yoshikawa
Venue: Journal of Robotic Systems (2005)

In this paper, we propose a kind of &ldquo;teaching by demonstration&rdquo; method, aiming at its application to humanoid robots at home in the future. The demonstrator's motion is captured by a pair of stereo cameras mounted on his&sol;her head, locating very close to his&sol;her eyes. By tracking the landmarks attached to the demonstrator's hand and the working environment, one can estimate not only the demonstrator's hand motion but also his&sol;her head motion, which can be used for the active vision system. Experimental result shows the effectiveness of the proposed framework. &copy; 2005 Wiley Periodicals, Inc.
Application of an expert computer system to federal tax planning
Authors: Robert Michaelson
Venue: Issue 82 (October 1982) (1982)

The author gratefully acknowledges the financial support of the American Institute of Certified Public Accountants, provision of computer facilities by the Computer Science Department of Stanford University, and the assistance of Professors Gerard D. Brighton and Donald Michie at the University of Illinois at Urbana-Champaign in bringing this project to completion.
Engineering Solution of a Basic Call-Center Model
Authors: Ward Whitt
Venue: Management Science (2005)

An algorithm is developed to rapidly compute approximations for all the standard steady-state performance measures in the basic call-center queueing modelM/GI/s/r+GI, which has a Poisson arrival process, independent and identically distributed (IID) service times with a general distribution,s servers,r extra waiting spaces and IID customer abandonment times with a general distribution. Empirical studies of call centers indicate that the service-time and abandon-time distributions often are not nearly exponential, so that it is important to go beyond the MarkovianM/M/s/r+M special case, but the general service-time and abandon-time distributions make the realistic model very difficult to analyze directly. The proposed algorithm is based on an approximation by an appropriate MarkovianM/M/s/r+M(n) queueing model, whereM(n) denotes state-dependent abandonment rates. After making an additional approximation, steady-state waiting-time distributions are characterized via their Laplace transforms. Then the approximate distributions are computed by numerically inverting the transforms. Simulation experiments show that the approximation is quite accurate. The overall algorithm can be applied to determine desired staffing levels, e.g., the minimum number of servers needed to guarantee that, first, the abandonment rate is below any specified target value and, second, that the conditional probability that an arriving customer will be served within a specified deadline, given that the customer eventually will be served, is at least a specified target value.
A hybrid analytic/rule-based approach to reservoir system management during flood
Authors: A. Karbowski, K. Malinowski, E. Niewiadomska-Szynkiewicz
Venue: Decision Support Systems (2005)

The article presents an approach to real-time operation of a water retention reservoir during flood. Water releases are calculated repetitively on the basis of two-variant inflow forecasts and some expert knowledge. During every intervention of the control algorithm, an optimization problem with the expected value type performance index is solved. In the paper, the basic characteristics of trajectories of outflows resulting from the application of this control method are analyzed. Afterwards, the results of the series of simulation experiments based on a large set of historical data concerning a big Polish reservoir are presented.
Hera presentation generator
Authors: Flavius Frasincar, Geert-Jan Houben, Peter Barna
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Semantic Web Information Systems (SWIS) are Web Information Systems that use Semantic Web technologies. Hera is a model-driven design methodology for SWIS. In Hera, models are represented in RDFS and model instances in RDF. The Hera Presentation Generator (HPG) is an integrated development environment that supports the presentation generation layer of the Hera methodology. The HPG is based on a pipeline of data transformations driven by different Hera models.
On the Error of Linear Interpolation and the Orientation, Aspect Ratio, and Internal Angles of a Triangle
Authors: Weiming Cao
Venue: SIAM Journal on Numerical Analysis (2005)

In this paper, we attempt to reveal the precise relation between the error of linear interpolation on a general triangle and the geometric characters of the triangle. Taking the model problem of interpolating quadratic functions, we derive two exact formulas for the $H^1$-seminorm and $L^2$-norm of the interpolation error in terms of the area, aspect ratio, orientation, and internal angles of the triangle. These formulas indicate that (1) for highly anisotropic triangular meshes the $H^1$-seminorm of the interpolation error is almost a monotonically decreasing function of the angle between the orientations of the triangle and the function; (2) maximum angle condition is not essential if the mesh is aligned with the function and the aspect ratio is of magnitude $\sqrt{|\lambda_1/\lambda_2|}$ or less, where $\lambda_1$ and $\lambda_2$ are the eigenvalues of the Hessian matrix of the function. With these formulas we identify the optimal triangles, which produce the smallest $H^1$-seminorm of the interpolation error, to be the acute isosceles aligned with the solution and of an aspect ratio about $0.8 |\frac{\lambda_1}{\lambda_2}|$. The $L^2$-norm of the interpolation error depends on the orientation and the aspect ratio of the triangle, but not directly on its maximum or minimum angles. The optimal triangles for the $L^2$-norm are those aligned with the solution and of an aspect ratio $\sqrt{|\lambda_1/\lambda_2|}$. These formulas can be used to formulate more accurate mesh quality measures and to derive tighter error bounds for interpolations.
A General Iterative Procedure for Solving Nonsmooth Generalized Equations
Authors: Michel H. Geoffroy, Alain Pietrus
Venue: Computational Optimization and Applications (2005)

We present a general iterative procedure for solving generalized equations in the nonsmooth framework. To this end, we consider a class of functions admitting a certain type of approximation and establish a local convergence theorem that one can apply to a wide range of particular problems.
Blind Ambition? The Effects of Social Networks and Institutional Sex Composition on the Job Search Outcomes of Elite Coeducational and Women's College Graduates
Authors: Maura A. Belliveau
Venue: Organization Science (2005)

In this paper, I develop a perspective on women's career attainment focused on how employers' salary offers may be constructed based on their assumptions regarding women's access to comparative salary information. Therefore, although the use of social networks in job search may enhance women's actual knowledge of prevailing wages, I hypothesize that institutional characteristics that employers could assume to constrain women's networks and concomitant access to salary information will directly affect salary offers, as well as moderating the influence of network ties on pay. To test this perspective, job search outcomes of women attending elite coeducational and women's colleges were examined. Regarding the number of offers obtained, women who consulted with proportionally more male peer and employed adult male advice ties received significantly more job offers than women using fewer male advice contacts. With regard to salary offers, this study reveals an institutional sex composition effect: women exiting single-sex institutions (i.e., women's colleges) received significantly lower salary offers than women from coeducational schools, even after accounting for human capital, job characteristics, and institutional reputation. The effects of social networks on pay were moderated by institutional sex composition such that women exiting women's colleges received lower returns in the form of salary to their cross-gender advice ties than did women from a matched coeducational institution. Implications of these results for theories of social capital and women's occupational attainment are discussed.
Secure Automation: Achieving Least Privilege with SSH, Sudo, and Suid
Authors: Robert A. Napier
Venue: Proceedings of the 18th USENIX conference on System administration (2004)

Automation tools commonly require some level of escalated privilege in order to perform their functions, often including escalated privileges on remote machines. To achieve this, developers may choose to provide their tools with wide-ranging privileges on many machines rather than providing just the privileges required. For example, tools may be made setuid root, granting them full root privileges for their entire run. Administrators may also be tempted to create unrestricted, null-password, root-access SSH keys for their tools, creating trust relationships that can be abused by attackers. Most of all, with the complexity of today's environments, it becomes harder for administrators to understand the far-reaching security implications of the privileges they grant their tools.In this paper we will discuss the principle of least privilege and its importance to the overall security of an environment. We will cover simple attacks against SSH, sudo and setuid and how to reduce the need for root-setuid using other techniques such as non-root setuid, setgid scripts and directories, sudo and sticky bits. We will demonstrate how to properly limit sudo access both for administrators and tools. Finally we will introduce several SSH techniques to greatly limit the risk of abuse including non-root keys, command keys and other key restrictions.
A Configurable Network Protocol for Cluster Based Communications using Modular Hardware Primitives on an Intelligent NIC
Authors: Ranjesh G. Jaganathan, Keith D. Underwood, Ron Sass
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

The high overhead of generic protocols like TCP/IP provides strong motivation for the development of a better protocol architecture for cluster-based parallel computers. Reconfigurable computing has a unique opportunity to contribute hardware level protocol acceleration while retaining the flexibility to adapt to changing needs. Specifically, applications on a cluster have various quality of service needs. In addition, these applications typically run for a long time relative to the reconfiguration time of an FPGA. Thus, it is possible to provide application-specific protocol processing to improve performance and reduce space utilization. Reducing space utilization permits the use of a greater portion of the FPGA for other application-specific processing. This paper focuses on work to create a set of parameterizable components that can be put together as needed to obtain a customized protocol for each application. To study the feasibility of such an architecture, hardware components were built that can be stitched together as needed to provide the required functionality. Feasibility is demonstrated using four different protocol configurations, namely: (1) unreliable packet transfer; (2) reliable, unordered message transfer without duplicate elimination; (3) reliable, unordered message transfer with duplicate elimination; and (4) reliable, ordered message transfer with duplicate elimination. The different configurations illustrate trade-offs between chip space and functionality.
Fault-Tolerant Scheduling
Authors: Bala Kalyanasundaram, Kirk R. Pruhs
Venue: SIAM Journal on Computing (2005)

We study fault-tolerant multiprocessor scheduling under the realistic assumption that the occurrence of faults cannot be predicted. The goal in these problems is to minimize the delay incurred by the jobs. Since this is an online problem we use competitive analysis to evaluate possible algorithms. For the problems of minimizing the makespan and minimizing the average completion time (for static release times), we give nonclairvoyant algorithms (both deterministic and randomized) that have provably asymptotically optimal competitive ratios. The main tool used by these algorithms to combat faults is redundancy. We also show that randomization has the same effect as redundancy.
Implicit heterogeneous and parallel programming
Authors: Chia-Chu Chiang
Venue: ACM SIGSOFT Software Engineering Notes (2005)

Programmers are often required to develop parallel programs using new parallel languages or parallel extensions to existing languages that are different from the languages they used previously on sequential machines. As a consequence, programmers are faced with unfamiliar programming models and are often compelled to program at a low level with specific target machines. In this paper, we are going to introduce an implicit parallel programming method that allows programmers to use their favorite sequential programming languages for heterogeneous and parallel programming. Implicit parallelism relieves programmers since they do not have to worry about the details of parallel execution.
Efficient Intrusion Detection using Automaton Inlining
Authors: Rajeev Gopalakrishna, Eugene H. Spafford, Jan Vitek
Venue: Proceedings of the 2005 IEEE Symposium on Security and Privacy (2005)

Host-based intrusion detection systems attempt to identify attacks by discovering program behaviors that deviate from expected patterns. While the idea of performing behavior validation on-the-fly and terminating errant tasks as soon as a violation is detected is appealing, existing systems exhibit serious shortcomings in terms of accuracy and/or efficiency. To gain acceptance, a numberof technical advances are needed. In this paper we focus on automated, conservative, intrusion detection techniques, i.e. techniques which do not require human intervention and do not suffer from false positives. We present a static analysis algorithm for constructing a flow- and context-sensitive model of a program that allows for efficient online validation. Context-sensitivity is essential to reduce the number of impossible control-flow paths accepted by the intrusion detection system because such paths provide opportunities for attackers to evade detection. An important consideration for on-the-fly intrusion detection is to reduce the performance overhead caused by monitoring. Compared to the existing approaches, our inlined automaton model (IAM) presents a good tradeoff between accuracy and performance. On a 32K line program, the monitoring overhead is negligible. While the space requirements of a naive IAM implementation can be quite high, compaction techniques can be employed to substantially reduce that footprint.
A random set characterization of possibility measures
Authors: Enrique Miranda, Inés Couso, Pedro Gil
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2004)

Several authors have pointed out the relationship between consonant random sets and possibility measures. However, this relationship has only been proven for the finite case, where the inverse Möbius of the upper probability induced by the random set simplifies the computations to a great extent. In this paper, we study the connection between both concepts for arbitrary referential spaces. We complete existing results about the lack of an implication in general with necessary and sufficient conditions for the most interesting cases.
Erdős-Ko-Rado with conditions on the minimum complementary degree
Authors: J. L. Goldwasser
Venue: Journal of Combinatorial Theory Series A (2005)

Let X = {1,2,...,n}, 2k < n, and let X(k) denote the set of all subsets of X of size k. A set system F ⊆ X(k) is intersecting if no two of its elements are disjoint. The minimum complementary degree c(F) of F is the minimum over all i ∈ X of the number of sets in F not containing i. A set system F ⊆ X(k) is complementary degree condition maximal (CDCM) if H ⊆ X(k) intersecting, c(H) ≥ c(F) ⇒ |H| ≤ |F| and SCDCM (S for strict) if equality holds on the right only if it holds on the left. In this paper we characterize all intersecting F ⊆ X(k) with c(F) ≤ (n-3 k-2) which are CDCM and SCDCM. The characterization is in terms of the cascade form of c(F), a representation in terms of sums of certain binomial coefficients. This result generalizes the Erdös-Ko-Rado and Hilton-Milner theorems and a theorem of Frankl's with conditions on the maximum degree. The number of isomorphically distinct set systems F ⊆ X(k) which are SCDCM is the Catalan number Ck-2 = 1/k-1 (2k-4 k-2), and the number which are CDCM is Σi=0k-2Ci.
Selected AI-Related Dissertations Assembled
Authors: Susanne M. Humphrey, Bob Krovetz
Venue: Issue 106 (October 1988) (1988)

The following are citations selected by title and abstract as being related to AI, resulting from a computer search, using the BRS Information Technologies retrieval service, of the Dissertation Abstracts International (DAI) database produced by University Microfilms International.The online file includes abstracts, which are not published in this listing, but the citations below do include the DAI reference for finding the abstract in the published DAI. Other elements of the citation are author; university, degree, and, if available, number of pages; title; UM order number and year-month of DAI; and DAI subject category chosen by the author of the dissertation. References are sorted first by the initial DAI subject category and second by the author. In addition the database includes masters abstracts, denoted by MAI (Masters Abstracts International) instead of DAI as the reference to the abstract in the published MAI.Unless otherwise specified, paper or microform copies of dissertations may be ordered from University Microfilms International, Dissertation Copies, Post Office Box 1764, Ann Arbor, MI 48106; telephone for U.S. (except Michigan, Hawaii, Alaska): 1-800-521-3042, for Canada: 1-800-268-6090. Price lists and other ordering and shipping information are in the introduction to the published DAI.
Optimal bounding cones of vectors in three dimensions
Authors: Gill Barequet, Gershon Elber
Venue: Information Processing Letters (2005)

The problem of computing the minimum-angle bounding cone of a set of three-dimensional vectors has numerous applications in computer graphics and geometric modeling. One such application is bounding the tangents of space curves or the vectors normal to a surface in the computation of the intersection of two surfaces.No optimal-time exact solution to this problem has been yet given. This paper presents a roadmap for a few strategies that provide optimal or near-optimal (time-wise) solutions to this problem, which are also simple to implement. Specifically, if a worst-case running time is required, we provide an O(n log n)-time Voronoi-diagram-based algorithm, where n is the number of vectors whose optimum bounding cone is sought. Otherwise, if one is willing to accept an, in average, efficient algorithm, we show that the main ingredient of the algorithm of Shirman and Abi-Ezzi [Comput. Graphics Forum 12 (1993) 261-272] can be implemented to run in optimal Θ(n) expected time. Furthermore, if the vectors (as points on the sphere of directions) are known to occupy no more than a hemisphere, we show how to simplify this ingredient (by reducing the dimension of the problem) without affecting the asymptotic expected running time. Both versions of this algorithm are based on computing (as an LP-type problem) the minimum spanning circle (respectively, ball) of a two-dimensional (respectively, three-dimensional) set of points.
Input Devices with Simple and Compact Haptic Feedback Mechanisms Driven by Finger Movement
Authors: Itsuo Kumazawa
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

Narrow key pitch of compact input devices confuses finger pressure at a key touch pad. To make keys more distinguishable and to improve user-friendliness of such input devices, we have introduced mechanisms that enhance tactile feedback and provide active reactions to userýs finger. So far, many of haptic devices have used motors or actuators to produce such active reactions. However, in order to make the device small, simple and reliable, we introduce mechanisms that produce the active reactions by transforming finger movement mechanically to up-down movement of sticks that stimulate fingertips. Effectiveness of these mechanisms is demonstrated by basic experiments.
Analysis of Dynamic Faults in Embedded-SRAMs: Implications for Memory Test
Authors: Simone Borri, Magali Hage-Hassan, Luigi Dilillo, Patrick Girard, Serge Pravossoudovitch, Arnaud Virazel
Venue: Journal of Electronic Testing: Theory and Applications (2005)

This paper presents the results of resistive-open defect insertion in different locations of Infineon 0.13 ¿m embedded-SRAM with the main purpose of verifying the presence of dynamic faults. This study is based on the injection of resistive defects as their presence in VDSM technologies is more and more frequent. Electrical simulations have been performed to evaluate the effects of those defects in terms of detected functional faults. Read destructive, deceptive read destructive and dynamic read destructive faults have been reproduced and accurately characterized. The dependence of the fault detection has been put in relation with memory operating conditions, resistance value and clock cycle, and the importance of at speed testing for dynamic fault models has been pointed out. Finally resistive Address Decoder Open Faults (ADOF) have been simulated and the conditions that maximize the fault detection have been discussed as well as the resulting implications for memory test.