ppxscal/embedding_network huggingface dataset:
Scheduling parallel machines by the dynamic newsboy problem
Authors: Konstantin Kogan
Venue: Computers and Operations Research (2004)

The newsboy problem is a well-known operations research model. Its various extensions have been applied to scheduling and evaluating advanced orders in manufacturing, retail and service industries.This paper focuses on a dynamic, continuous-time generalization of the single period newsboy problem. Similar to the classical newsboy problem, the model may represent the inventory of an item that becomes obsolete quickly, spoils quickly, or has a future that is uncertain beyond a single period. The problem is characterized by a number of newsboys (machines) whose operations are organized and controlled in parallel. The objective is to minimize shortage and surplus costs occurring at the end of the period as in the classical newsboy problem, as well as intermediate production and surplus costs that are incurred at each time point along the period. We prove that this continuous-time problem can be reduced to a number of discrete-time problems which are determined by loose, balanced and pressing production conditions. As a result, a polynomial-time combinatorial algorithm is derived in order to find globally optimal solutions.
Comparison of Several Wavelet Coefficient Confusion Methods Applied in Multimedia Encryption
Authors: Shiguo Lian, Zhiquan Wang
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

Wavelet transform is widely used in image and video encoding. And some multimedia encryption methods have been proposed during the past decade. The methods based on wavelet coefficient confusion are often used in wavelet encoding. This paper proposes a coefficient confusion method based on quad-tree structure. The method, together with the other two confusion methods, is analyzed by comparing their key space, effect on compression ratio and bit rate control. And some means are proposed to strengthen the security of the encryption system. The analysis and experiment results show that the confusion method based on quad-tree confusion is of low-cost and is easy to realize bit rate control, so it is suitable for image or video encryption in network transform with real-time requirement, especially in mobile multimedia network.
Existence results and numerical solutions for a beam equation with nonlinear boundary conditions
Authors: T. F. Ma
Venue: Applied Numerical Mathematics (2003)

We study the existence of solutions of the nonlinear fourth order equation of Kirchhoff type u(iv)-m(∫0L|u'(s)|2ds)u''=f(x,u), under nonlinear boundary conditions which models the deformations of beams on elastic supports.
Lexical cohesion computed by thesaural relations as an indicator of the structure of text
Authors: Jane Morris, Graeme Hirst
Venue: Computational Linguistics (1991)

In text, lexical cohesion is the result of chains of related words that contribute to the continuity of lexical meaning. These lexical chains are a direct result of units of text being "about the same thing," and finding text structure involves finding units of text that are about the same thing. Hence, computing the chains is useful, since they will have a correspondence to the structure of the text. Determining the structure of text is an essential step in determining the deep meaning of the text. In this paper, a thesaurus is used as the major knowledge base for computing lexical chains. Correspondences between lexical chains and structural elements are shown to exist. Since the lexical chains are computable, and exist in non-domain-specific text, they provide a valuable indicator of text structure. The lexical chains also provide a semantic context for interpreting words, concepts, and sentences.
Domain-Specific Web Search with Keyword Spices
Authors: Satoshi Oyama, Takashi Kokubo, Toru Ishida
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Abstract--Domain-specific Web search engines are effective tools for reducing the difficulty experienced when acquiring information from the Web. Existing methods for building domain-specific Web search engines require human expertise or specific facilities. However, we can build a domain-specific search engine simply by adding domain-specific keywords, called ¿keyword spices,¿ to the user's input query and forwarding it to a general-purpose Web search engine. Keyword spices can be effectively discovered from Web documents using machine learning technologies. This paper will describe domain-specific Web search engines that use keyword spices for locating recipes, restaurants, and used cars.
Discrete Isoperimetric Inequalities and the Probability of a Decoding Error
Authors: Jean-Pierre Tillich, Gilles Zémor
Venue: Combinatorics, Probability and Computing (2000)

We derive improved isoperimetric inequalities for discrete product measures on the n-dimensional cube. As a consequence, a general theorem on the threshold behaviour of monotone properties is obtained. This is then applied to coding theory when we study the probability of error after decoding.
Active capture: automatic direction for automatic movies
Authors: Marc Davis, Jeffrey Heer, Ana Ramirez
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

The Active Capture demonstration is part of a new computational media production paradigm that transforms media production from a manual mechanical process into an automated computational one that can produce mass customized and personalized media integrating video of non-actors. Active Capture leverages media production knowledge, computer vision and audition, and user interaction design to automate direction and cinematography and thus enables the automatic production of annotated, high quality, reusable media assets. The implemented system automates the process of capturing a non-actor performing two simple reusable actions ("screaming" and "turning her head to look at the camera") and automatically integrates those shots into various commercials and movie trailers.
Detecting ripple effects of program modifications on a software system's functionality
Authors: Jean-Christophe Deprez
Venue:  (2003)

When changing a line of source code, a programmer needs to know how changing that line may affect the end-user functionality of the software system. In this dissertation, we explore a method that uses system tests to relate software functions (units of software functionality) to source code. This method can be used to predict the software functions potentially affected by a change at a particular spot in the source code. The quality of a prediction is measured in terms of its safety and its precision. These two attributes are respectively addressed by answering the following questions: Are all potentially affected software functions predicted, and are all software functions predicted potentially affected? We define a source code coverage criterion in terms of sets of inter-procedural paths. When a system test that satisfies this criterion is used, our method guarantees safe predictions for a large class of software functions. For most systems achieving such source code coverage may require an exponential number of system tests. Moreover, the precision of predictions is not guaranteed. Consequently, we create a new set of test selection criteria on the basis that all these new criteria must always be satisfied by a small number of system tests. Case studies on two software systems, namely scalc and bool, show that sets of system tests that satisfy our new criteria enable our method to compute safe predictions 70% of the time and safe and precise predictions between 60&ndash;70% of the time. These results are not at a level where our method would supersede a programmer's manual analysis. However, they complement manual predictions by improving a programmer's confidence in the result of her/his manual analysis. Incidentally, during our two case studies, we observed that our method always corrected the programmer when he made a wrong manual prediction.
Detecting Interesting Exceptions from Medical Test Data with Visual Summarization
Authors: Einoshin Suzuki, Takeshi Watanabe, Hideto Yokoi, Katsuhiko Takabayashi
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

In this paper, we propose a method which visualizes irregularmulti-dimensional time-series data as a sequence ofprobabilistic prototypes for detecting exceptions from medicaltest data. Conventional visualization methods often requireiterative analysis and considerable skill thus are nottotally supported by a wide range of medical experts. OurPrototypeLines displays summarized information based ona probabilistic mixture model by using hue only thus is consideredto exhibit novelty. The effectiveness of the summarizationis pursued mainly through use of a novel informationcriterion. We report our endeavor with chronic hepatitisdata, especially discoveries of interesting exceptions bya non-expert and an untrained expert.
Multimedia integration in the RACE BANK multimedia broadband cooperation projects
Authors: Norbert Luttenberger
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2 (1993)

Within the framework of the European research programme RACE a project called BANK ("Banking Applications using IBC Network") has been established. In this project, two major European banks cooperate with three software houses, a telecom supplier and an IT supplier with the goal of investigating and prototyping a multimedia banking self-service terminal. This terminal will allow the banks to offer their customers both high-quality, eye-catching information on banking services and the opportunity to enter a desktop conference with a remote bank expert. The conference includes audio, face-to-face video and shared text/graphics applications that support the expert in promoting certain banking services to the customer. This paper details the project scenario background and discusses the technologies that have been applied to multimedia integration, including computer platform and networking related questions. Design criteria for the shared application are presented, and some overall conclusions are drawn.
Variational arbitrary lagrangian-eulerian method
Authors: Michael Ortiz
Venue:  (2003)

This thesis is concerned with the development of Variational Arbitrary Lagrangian-Eulerian method (VALE) method. VALE is essentially finite element method generalized to account for horizontal variations, in particular, variations in nodal coordinates. The distinguishing characteristic of the method is that the variational principle simultaneously supplies the solution, the optimal mesh and, in case problems of shape optimization, optimal shape. This is accomplished by rendering the functional associated with the variational principle stationary with respect to nodal field values as well as with respect to the nodal positions of triangulation of the domain of analysis. Stationarity with respect to the nodal positions has the effect of the equilibriating the energetic or configurational forces acting in the nodes. Further, configurational force equilibrium provides precise criterion for mesh optimality. The solution so obtained corresponds to minimum of energy functional (minimum principle) in static case and to the stationarity of action sum (discrete Hamilton's stationarity principle) in dynamic case, with respect to both nodal variables and nodal positions. Further, the resulting mesh adaption scheme is devoid of error estimates and mesh-to-mesh transfer interpolation errors. We illustrate the versatility and convergence characteristics of the method by way of selected numerical tests and applications, including the problem of semi-infinite crack, the shape optimization of elastic inclusions and free vibration of 1-d rod.
Computing Cournot Equilibria in Two Settlement Electricity Markets with Transmission Constraints
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

We formulate a two-settlement equilibrium in competitive electricity markets as a subgame-perfect Nash equilibrium in which each generation .rm solves a Mathematical Program with Equilibrium Constraints (MPEC), given other firms' forward and spot strategies. We implement two computational approaches, one of which is based on a Penalty Interior Point Algorithm and the other is based on a steepest descent approach. We apply the algorithm to a six node illustrative example.
A Comparison of Coverage-Based and Distribution-Based Techniques for Filtering and Prioritizing Test Cases
Authors: David Leon, Andy Podgurski
Venue: Proceedings of the 14th International Symposium on Software Reliability Engineering (2003)

This paper presents an empirical comparison of fourdifferent techniques for filtering large test suites: testsuite minimization, prioritization by additional coverage,cluster filtering with one-per-cluster sampling, andfailure pursuit sampling. The first two techniques arebased on selecting subsets that maximize code coverageas quickly as possible, while the latter two are based onanalyzing the distribution of the tests' execution profiles.These techniques were compared with data sets obtainedfrom three large subject programs: the GCC, Jikes, andjavac compilers. The results indicate that distribution-basedtechniques can be as efficient or more efficient forrevealing defects than coverage-based techniques, butthat the two kinds of techniques are also complementaryin the sense that they find different defects. Accordingly,some simple combinations of these techniques wereevaluated for use in test case prioritization. The resultsindicate that these techniques can create more efficientprioritizations than those generated using prioritizationby additional coverage.
Extremely Low-Power Logic
Authors: Christian Piguet, Jacques Gautier, Christoph Heer, Ian O'Connor, U. Schlichtmann
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

For extremely Low-power Logic, three very new and promising techniques will be described. The first are methods on circuit and system level for reduced supply voltages. In large logic blocks, interconnect becomes a main issue, that could be solved by on-chip optical interconnect. Nano-devices will also be presented, as a possibility to compute with nearlyzero power, and compared to future 10 nanometers transistors.
A theoretical framework for measuring the success of customer relationship management outsourcing
Authors: Babita Gupta, Lakshmi S. Iyer
Venue: Business strategies for information technology management (2003)

Dramatic growth of e-commerce has increased the bargaining power of customers requiring changes in strategies for Customer Relationship Management (CRM) development and implementation on the part of firms. Success of CRM implementations is thus critical for firms to survive in the 21st century. Because of the complex technologies involved in CRM, companies are choosing to outsource to vendors that specialize in CRM. In this study, we propose a theoretical framework that examines the CRM outsourcing success. Based on prior literature, we propose that CRM outsourcing success is influenced by degree of CRM outsourcing, partnership quality between the outsourcing firm and the vendor, organizational factors of the outsourcing firm, and the service quality of the vendor.
Visualization of Communication Patterns in Collaborative Innovation Networks - Analysis of Some W3C Working Groups
Authors: Peter A. Gloor, Rob Laubacher, Scott B. C. Dynes, Yan Zhao
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Collaborative Innovation Networks (COINs) are groups of self-motivated individuals from various parts of an organization or from multiple organizations, empowered by the Internet, who work together on a new idea, driven by a common vision. In this paper we report first results of a project that examines innovation networks by analyzing the e-mail archives of some W3C (WWW consortium) working groups. These groups exhibit ideal characteristics for our purpose, as they form truly global networks working together over the Internet to develop next generation technologies. We first describe the software tools we developed to visualize the temporal communication flow, which represent communication patterns as directed acyclic graphs, We then show initial results, which revealed significant variations between the communication patterns and network structures of the different groups., We were also able to identify distinctive communication patterns among group leaders, both those who were officially appointed and other who were assuming unofficial coordinating roles.
met*: a method for discriminating metonymy and metaphor by computer
Authors: Dan Fass
Venue: Computational Linguistics (1991)

The met* method distinguishes selected examples of metonymy from metaphor and from literalness and anomaly in short English sentences. In the met* method, literalness is distinguished because it satisfies contextual constraints that the nonliteral others all violate. Metonymy is discriminated from metaphor and anomaly in a way that [1] supports Lakoff and Johnson's (1980) view that in metonymy one entity stands for another whereas in metaphor one entity is viewed as another, [2] permits chains of metonymies (Reddy 1979), and [3] allows metonymies to co-occur with instances of either literalness, metaphor, or anomaly. Metaphor is distinguished from anomaly because the former contains a relevant analogy, unlike the latter. The met* method is part of Collative Semantics, a semantics for natural language processing, and has been implemented in a computer program called meta5. Some examples of meta5's analysis of metaphor and metonymy are given. The met* method is compared with approaches from artificial intelligence, linguistics, philosophy, and psychology.
Group Registration for Reducing Signaling Traffic in Location Tracking
Authors: Zuji Mao, Christos Douligeris
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

In this paper, a new location registration strategy-groupregistration-for mobile networks is proposed, in which insteadof sending a location registration request to the homelocation register (HLR) for each registration area (RA)change of a mobile terminal (MT), the identifications of theMTs newly moving into an RA are buffered and sent to theHLR for location registration when the next incoming callto the RA occurs, i.e., the buffered MT identifications areforwarded to the HLR in the route response message of thecall. Upon RA change, a forwarding pointer is set up fromthe MT's local anchor to its new visitor location register(VLR), so that incoming calls to the MT can be deliveredbefore the MT's local anchor is changed to its current VLRvia the next group registration. An analytic model is developedand numerical results are presented. It is revealedthat compared to the conventional RA-based location registrationscheme, the group registration strategy can achievea significant cost savings over a wide range of system parameters.
Goalkeeper: Close-In Interface Protection
Authors: Stephen D. Wolthusen
Venue: Proceedings of the 19th Annual Computer Security Applications Conference (2003)

This paper discusses a potential security issue in commonoperating system and application environments regardingdynamically attached devices and device interfaces.A set of countermeasures for the identified threats is describedalong with the integration of countermeasures intoa policy-based security infrastructure; finally, an implementationof the countermeasure in the form of a policy enforcementmodule integrated into the kernel of the Microsoft Windows2000/XP family of operating systems is described.
Using structure patterns of temporal and spectral feature in audio similarity measure
Authors: Rui Cai, Lie Lu, Hong-Jiang Zhang
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Although statistical characteristics of audio features are widely used for similarity measure in most of current audio analysis systems and have been proved to be effective, they only utilized the averaged feature variations over time, and thus lead to inaccuracy in some cases. In this paper, structure pattern, which describes the representative structure characteristics of both temporal and spectral features, is proposed to improve the similarity measure for audio effects. Three kind structure patterns are proposed and utilized in current work, including energy contour pattern, harmonicity pattern and pitch contour pattern. Evaluations on a content-based audio retrieval system indicate that structure patterns can improve the performance pretty much.
Procedural Security in Electronic Voting
Authors: Alexandros Xenakis, Ann Macintosh
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

In this paper we explore the security related procedures that are required for the successful development and deployment of electronic voting in legally-binding government elections. Initiating our research on the theoretical basis, which justifies the necessity for security in deploying electronic elections, we further explore the question of who and whatshould be safeguarded in the course of the e-electoral process. Based on our research study, we suggest that security in e-voting has two aspects, the technical and the procedural one. It is recognised that from the technical perspective further research is necessary to ensure full and complete voter authentication and voting security to enable an e-election. However, weargue that e-voting security can also be enhanced through providing procedural security measures at specific points in the e-electoral process.Our analysis of the Electoral Commission's evaluation reports on the 2002 UK local government e-voting pilots identified past cases of procedural security issues. Interviews and observations conducted during the 2003 UK e-voting pilots further confirmed these issues. We have established the need to further explore the re-design of the electoral process andconsider procedural security as primarily applicable to agent-related processes. In view of the increased complexity of the e-voting processes, which can involve multi-channel e-voting options, and the increase in the number of agents involved in the administration of e-elections,we relate procedural security to the need for transparent allocation of responsibilities among the different agents. In concluding we argue that existing procedural security should be enhanced, that there is a clear need for better monitoring of compliance to such procedures and that further security procedures need to be put in place at specific points in the e-electionprocess.
Computer science students' conception of the relationship between reward (grade) and cooperation
Authors: Orit Hazzan
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

The study presented in this article focuses on the conceptions of computer sciences students of the relationships between reward and cooperation in the context of software development. Specifically, students were faced with a conflict between their urge to express personal skills, and the unavoidable need to cooperate with their teammates. The results indicate that if a given financial bonus is distributed among team members, the majority of the students prefer that a small portion of the bonus be allocated based on individual contributions, while the majority of the reward is divided equally among the team members. These result are analyzed in the context of software engineering education. Based on this study, this paper suggests a tool which can be used by instructors, both for forming of teams and for team evaluation.