ppxscal/embedding_network huggingface dataset:
Multi-Thread IO in High Quality Digital Broadcasting System
Authors: Shuo Wang, Jiangling Zhang, Dan Feng
Venue: Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing (2003)

To meet the need of performance in high quality digital broadcasting systems (HQDBS), such as high IO width, no frame loss, and seamless switch etc, an algorithm called MPPDIO (multi-thread parallel prefetch Direct IO) is proposed in this paper. The size of the sharing buffer between multi-threads is modeled and calculated. To investigate the validation of the MPPDIO algorithm, the I/O performances are analyzed and compared when adopting a traditional pre-cache sequence algorithm and adopting the MPPDIO algorithm, and a set of comparable experiments is proceeded.Analysis and test results indicate that the traditional pre-cache sequence algorithm can't meet the need of performance, and the MPPDIO algorithm not only can perfectly satisfy the performance requirements but also can improve the utilization of disk I/O channel and reduce the load of CPU. The MPPDIO algorithm can also meet the requirements of digital broadcasting on HDTV (high definition television), which needs the same performance as the HQDBS.
Knowledge discovery in distributed cardiac imagebases
Authors: Norberto Ezquerra
Venue: ACM SIGBIO Newsletter (1998)

Based on knowledge discovery and data mining methodologies, we present research with the overall objective of developing a clinically useful, computer based system to aid in accurate and reliable assessment of coronary artery disease (CAD). The emphasis is placed on designing, implementing and testing a methodology for "mining" distributed clinical databases in order to discover potential associations and interdependencies that may be imbedded in geographically dispersed databases. Subsequently, all newly discovered (and validated) knowledge will be used to enrich a knowledge base designed to interpret both myocardial perfusion imagery and other relevant patient information. The validated knowledge base will ultimately be integrated into an interactive and visual consultation framework, which will be placed in the context of Internet-based communications to provide widespread access to remote users.
Measuring effectiveness of constructivist and behaviourist assignments in CS102
Authors: J. R. Parker, Katrin Becker
Venue: ACM SIGCSE Bulletin (2003)

Two approaches to setting programming assignments are compared, using actual assignment and solutions from two distinct CS102 lecture sections during the same semester. The complexity and effort represented by the solutions is compared using software engineering metrics, giving a measure of the effectiveness of the two assignments sets, and student performance in successor courses is also examined.
Higher-order narrowing with definitional trees
Authors: Michael Hanus, Christian Prehofer
Venue: Journal of Functional Programming (1999)

Functional logic languages with a sound and complete operational semantics are mainly based on an inference rule called narrowing. Narrowing extends functional evaluation by goal solving capabilities, as in logic programming. Due to the huge search space of simple narrowing, steadily improved narrowing strategies have been developed in the past. Needed narrowing is currently the best narrowing strategy for first-order functional logic programs due to its optimality properties wrt the length of derivations and the number of computed solutions. In this paper, we extend the needed narrowing strategy to higher-order functions and &lambda;-terms as data structures. By the use of definitional trees, our strategy computes only independent solutions. Thus, it is the first calculus for higher-order functional logic programming which provides for such an optimality result. Since we allow higher-order logical variables denoting &lambda;-terms, applications go beyond current functional and logic programming languages. We show soundness and completeness of our strategy with respect to LNT reductions, a particular form of higher-order reductions defined via definitional trees. A general completeness result is only provided for terminating rewrite systems due to the lack of an overall theory of higher-order reduction which is outside the scope of this paper.
Toward an environment for comprehending distributed systems
Authors: Maher Salah, Spiros Mancoridis
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

Many modern software systems are often large, distributed,written in more than one programming language,and developed using pre-built components. This paperpresents the results of the first phase of a project to developan environment that supports the comprehension ofdistributed systems.The environment has a layered architecture consistingof three subsystems: data gathering, data repository, andmodeling/visualization. The first phase of the project focuseson the design and implementation of the data gatheringand data repository subsystems. The key requirementsof the environment are to support: (a) static and dynamicanalysis, (b) multiple languages, (c) distributed systems,and (d) component-based models.
Semantic Role Parsing: Adding Semantic Structure to Unstructured Text
Authors: Sameer Pradhan, Kadri Hacioglu, Wayne Ward, James H. Martin, Daniel Jurafsky
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

There is a ever-growing need to add structure in the formof semantic markup to the huge amounts of unstructured textdata now available. We present the technique of shallow semanticparsing, the process of assigning a simple WHO didWHAT to WHOM, etc., structure to sentences in text, as auseful tool in achieving this goal. We formulate the semanticparsing problem as a classification problem using SupportVector Machines. Using a hand-labeled training setand a set of features drawn from earlier work together withsome feature enhancements, we demonstrate a system thatperforms better than all other published results on shallowsemantic parsing.
Potential roles for business-to-business marketplace providers in service-oriented architectures
Authors: Markus Lenz, Markus Greunz
Venue: Managing e-commerce and mobile computing technologies (2003)

The chapter introduces the concept of a service-oriented architecture and assesses its applicability to business-to-business (B2B) marketplaces. In order to provide substantial value to their members, marketplaces have to offer a comprehensive service offering which aims to support all phases of the transaction process. Building up such a service offering is not a one-time effort; electronic B2B marketplaces will have to evolve their service offerings continually and adapt them to the ever-changing needs of the companies they serve. Therefore, instead of trying to create such an extensive service offering on their own, we argue that B2B marketplaces have to make use of partnerships with specialized service providers.They can make use of the speed and scale of such a collaboration of specialists only by partnering (Ernst et al., 2001). This view of B2B marketplaces as integrators of services from multiple parties puts some new demands on architectural issues of the marketplaces. A service-oriented architecture may help to cope with these new demands. To test this view, a survey among European B2B marketplaces has been conducted in order to match their service development and their needs with the characteristics of a service-oriented architecture and the potential roles that marketplace providers can play in such a concept.
A Framework for Assessing IT Integration Decision-Making in Mergers and Acquisitions
Authors: Manjari Mehta, Rudy Hirschheim
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Organizations have actively pursued mergers and acquisitions (M&As) over the past several decades but unfortunately almost half of these M&As have been unsuccessful, forcing researchers and practitioners alike to rethink the merger integration process that is so critical to M&A success. One vital aspect on the integration agenda is the integration of the two IT functions within the merging partners. In this paper, we offer a conceptual framework to understand why and when certain IT integration decisions are made during M&As. Three theoretical lenses -- symbolism, power and strategic alignment are offered to interpret mergers in their pre-merger, merger and post-merger phases. It is contended that three factors govern much of the IT decision-making during merger integration: (a) the aura' of the Wall Street -- and the promise' that the merging firms make to Wall Street analysts to achieve extraordinary cost-savings within a restrictive time frame; (b) the acquirer's influence on the acquired firm, enforcing certain system choices on the acquired people; and (c) the goal to achieve business-IT strategic alignment. Influenced by Wall Street's expectations and the acquirer's persuasions, the new merged IT function may not be able to identify the best new arrangement of information systems infrastructure, people and processes, as prescribed by the strategic alignment lens, at least in the early phases of the merger process. We conclude the paper by illustrating some typical IT integration decisions that may be interpreted using these three lenses, and resulting practical implications. Through this paper, we hope to bring the M&A context to the IS researcher's attention and provide a theoretical grounding to base future empirical research on.
A proposal for a Fortran loop construct
Authors: Walt Brainerd
Venue: ACM SIGPLAN Notices (1977)

The block IF, ELSE IF, ELSE, and END IF statements [1] have been added during revision of the draft proposed ANS FORTRAN [2]. There have been several suggestions to add new looping constructs, such as DO WHILE or DO UNTIL. There are at least two reasons for not adopting these proposals at this time:1. The DO statement is already available in FORTRAN. Although the syntax may not be elegant by current standards, it is possible to construct loops and leave them using the GO TO statement.2. The constructs proposed only handle special cases of what is needed: a convenient way of leaving from any point in a loop and leaving any level of nesting of loops.Presumably, control structures will be one of the first items discussed when and if work is begun on another revision of the FORTRAN standard. The purpose of this note is to generate some discussion and perhaps some implementations, so that decisions to include other control structures will be based on more experience than is available now. Only loop constructs will be discussed.
OCL-Based Automated Validation Method for UML Specifications
Authors: L. Ol'khovich, D. V. Koznov
Venue: Programming and Computing Software (2003)

The paper is devoted to the validation of visual software models. The aim of the validation is to verify whether the models match the visual project language, which is a dialect of a standard visual modeling language (UML, SDL, etc.) created with regard to specific features of the particular project on software development. In the paper, an architecture of a validator designed for both interactive and batch modes is suggested. An approach to specifying visual project languages by means of OCL constraints imposed on the UML metamodel with the subsequent automated generation of validators in accordance with the architecture described is suggested. Results of approbation of the validator and the validator generator in the framework of an industry project are presented.
A Logic Level Design Methodology for a Secure DPA Resistant ASIC or FPGA Implementation
Authors: Kris Tiri, Ingrid Verbauwhede
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper describes a novel design methodology to implement a secure DPA resistant crypto processor. The methodology is suitable for integration in a common automated standard cell ASIC or FPGA design flow. The technique combines standard building blocks to make new'compound standard cells, which have a close to constant power consumption. Experimental results indicate a 50 times reduction in the power consumption fluctuations.
Privacy-preserving k-means clustering over vertically partitioned data
Authors: Jaideep Vaidya, Chris Clifton
Venue: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (2003)

Privacy and security concerns can prevent sharing of data, derailing data mining projects. Distributed knowledge discovery, if done correctly, can alleviate this problem. The key is to obtain valid results, while providing guarantees on the (non)disclosure of data. We present a method for k-means clustering when different sites contain different attributes for a common set of entities. Each site learns the cluster of each entity, but learns nothing about the attributes at other sites.
The complexity of minimal satisfiability problems
Authors: Lefteris M. Kirousis, Phokion G. Kolaitis
Venue: Information and Computation (2003)

A dichotomy theorem for a class of decision problems is a result asserting that certain problems in the class are solvable in polynomial time, while the rest are NP-complete. The first remarkable such dichotomy theorem was proved by Schaefer in 1978. It concerns the class of generalized satisfiability problems SAT(S), whose input is a CNF(S)-formula, i.e., a formula constructed from elements of a fixed set S of generalized connectives using conjunctions and substitutions by variables. Here, we investigate the complexity of minimal satisfiability problems MIN SAT(S), where S is a fixed set of generalized connectives. The input to such a problem is a CNF(S)-formula and a satisfying truth assignment; the question is to decide whether there is another satisfying truth assignment that is strictly smaller than the given truth assignment with respect to the coordinate-wise partial order on truth assignments. Minimal satisfiability problems were first studied by researchers in artificial intelligence while investigating the computational complexity of propositional circumscription. The question of whether dichotomy theorems can be proved for these problems was raised at that time, but was left open. We settle this question affirmatively by establishing a dichotomy theorem for the class of all MIN SAT(S)-problems, where S is a finite set of generalized connectives. We also prove a dichotomy theorem for a variant of MIN SAT(S) in which the minimization is restricted to a subset of the variables, whereas the remaining variables may vary arbitrarily (this variant is related to extensions of propositional circumscription and was first studied by Cadoli). Moreover, we show that similar dichotomy theorems hold also when some of the variables are assigned constant values. Finally, we give simple criteria that tell apart the polynomial-time solvable cases of these minimal satisfiability problems from the NP-complete ones.
Characteristics of the Double Avalanche Region IMPATT Diode in Millimetric Range
Authors: R. De La Cruz, A. Zemliak
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

The new n+pvnp+ structure for the avalanchediode was proposed some years ago to improve thefrequency characteristics. This type of the diode wasnamed as the Double Avalanche Region (DAR)IMPATT diode. This structure includes the twoavalanche regions inside the diode. The chargecarriers multiply in the avalanche region and than driftalong the drift zone v with the constant speed. Thesecarriers multiply ones again into another avalanchezone. The phase delay, which was produced by meansof two avalanche zones and the drift zone v is sufficientfor the negative resistance obtain for the widefrequency region. The characteristics of the DARIMPATT diode can be analyzed on the basis of thenumerical precise model. In this work we develop thenumerical model of the diode, which permit analysesthe physical processes into the DAR structure. Theadmittance characteristics of the diode were analyzedin very wide frequency region. The admittance andgenerating power dependencies from the amplitude ofthe first harmonic voltage were analyzed too. Theobtained results serve as the first step to the moreprofound analysis and structure optimization of theDAR diodes.
Hundreds of impossibility results for distributed computing
Authors: Faith Fich, Eric Ruppert
Venue: Distributed Computing (2003)

We survey results from distributed computing that show tasks to be impossible, either outright or within given resource bounds, in various models. The parameters of the models considered include synchrony, fault-tolerance, different communication media, and randomization. The resource bounds refer to time, space and message complexity. These results are useful in understanding the inherent difficulty of individual problems and in studying the power of different models of distributed computing. There is a strong emphasis in our presentation on explaining the wide variety of techniques that are used to obtain the results described.
Special Section: Topological representation and reasoning in design and manufacturing
Authors: Dan Braha
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2001)

Topology deals with geometric properties that are dependent only on the relative positions of the components of figures and not on such concepts as length, size, and magnitude. Topology supports design and representation of mechanical devices, communication and transportation networks, topographic maps, and planning and controlling of complex activities. In addition, aspects of topology are closely related to symbolic logic, which forms the foundation of artificial intelligence. By approaching engineering design from this abstract point of view, it is possible to use topological methods to study collections of geometric objects or collections of entities that are of concern in design analysis or synthesis. The importance of topological representation and reasoning in analysis, design, and manufacturing is heightened by the contemporary view that stresses the need for conceptual design.
Identifying the Potential for Market Power in Electric Power Systems in Real-Time
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

The analysis of recently restructured electric power systems has led to discussions concerning the ability of market participants to manipulate the market to their advantage. Indeed there areinstances in which market manipulation has been convincingly established. In this paper we advocate a practical and objective approach to examine market power based on revenue sensitivities. Computing the sensitivities requires only currently available information together with the rules used to operate the electricity market and system. We specifically identify those suppliers with the ability to increase revenues by raising prices or withholding capacity. These suppliers may enjoy some measure of market power since such ability would not be possible in a competitive market in which their generation is easily substitutable. We present a visualization of relevant metrics that have the potential to allow those with the market monitoring function to observe opportunities for market power in real-time. Possible uses for the information are discussed.
Excuse me, but are you human?
Authors: Yong Rui, Zicheg Liu
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Web services designed for human users are being abused by computer programs (bots). The bots steal thousands of free email accounts in a minute; participate in online polls to skew results; and irritate people by joining online chat rooms. These real-world issues have recently generated a new research area called Human Interactive Proofs (HIP), whose goal is to defend services from malicious attacks by differentiating bots from human users. We propose a new HIP algorithm based on detecting human face and facial features. Human faces are the most familiar object to humans, rendering it possibly the best candidate for HIP. We conducted user studies and showed the ease of use of our system to human users. We designed attacks using the best existing face detectors and demonstrated the difficulty to bots.
Invariant tests for symmetry about an unspecified point based on the empirical characteristic function
Authors: N. Henze, B. Klar, S. G. Meintanis
Venue: Journal of Multivariate Analysis (2003)

This paper considers a flexible class of omnibus affine invariant tests for the hypothesis that a multivariate distribution is symmetric about an unspecified point. The test statistics are weighted integrals involving the imaginary part of the empirical characteristic function of suitably standardized given data, and they have an alternative representation in terms of an L2-distance of nonparametric kernel density estimators. Moreover, there is a connection with two measures of multivariate skewness. The tests are performed via a permutational procedure that conditions on the data.
Experiences from an Implementation Project - Time Management and Control in Home Care
Authors: Riikka Vuokko
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

This study is about the first trials during the implementation of a palm-based computer system in home care. The implementation project was carried out for several reasons. There was a need to gather information about the service calls. The palm-based system makes it also possible for the workers to utilize the information of the client database during service calls. Being assisted by a palm-based system has believed to raise the level of efficiency in home care and ease the process of growing professionalism amongst the workers.The study was carried out as a qualitative ethnographic study during the pilot phase of theimplementation. First reactions of the care workers taking part in the trial period were more or less negative. The general attitude of the care workers was that the new system was implemented in order to place their work under the lens of surveillance. On the other hand, some of the workers felt that the new system enabled them to have more control of their working schedules and of carrying out different care tasks during a work day. Actual effects of the implementation and the possible changes in work practices can be seen only after a longer study.
System-level power-performance trade-offs in task scheduling for dynamically reconfigurable architectures
Authors: Juanjo Noguera, Rosa M. Badia
Venue: Proceedings of the 2003 international conference on Compilers, architecture and synthesis for embedded systems (2003)

Dynamic scheduling for System-on-Chip (SoC) platforms has become an important field of research due to the emerging range of applications with dynamic behavior (e.g. MPEG-4). Dynamically reconfigurable architectures are an interesting solution for this type of applications.However, dynamic scheduling for run-time reconfigurable architectures with power-performance trade-offs has not been addressed in previous research efforts. In this paper, we address this open issue using a system-level approach. Within our approach, we have used clock-gating and frequency-scaling strategies for power consumption minimization, jointly with our proposed architecture and scheduling algorithms.Device reconfiguration is a high-power consumption process. Thus reducing the number of device reconfigurations not only helps to reduce the reconfiguration overhead penalty (minimizing the application execution time), but also helps to reduce the system-level power consumption. Thus, dynamic task scheduling and reconfiguration context scheduling become a critical issue for power-performance trade-offs in embedded systems design.