ppxscal/embedding_network huggingface dataset:
Economic Analysis of the Market for Software Vulnerability Disclosure
Authors: Karthik Kannan, Rahul Telang, Hao Xu
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 7 - Volume 7 (2004)

Software vulnerability identification and their disclosure has been a critical area of concern for policy makers. Traditionally, Computer Emergency Response Team (CERT) has been acting as an infomediary between benign identifiers who report vulnerability information and users of the software. After verifying a reported vulnerability, and obtaining the remediation in the form of a patch from the software vendor, the infomediary -- CERT -- sends out a public "advisory" to inform software users about it. In the CERT-type mechanism, reporting vulnerabilities is voluntary with no explicit monetary gains to benign identifiers.Of late, firms such as iDefense have been proposing a different market-based mechanism. In this market-based mechanism, the infomediary rewards identifiers for each vulnerability disclosed to it. The infomediary then shares this information with its clients who are users ofthis software. Using this information, clients can protect themselves against attacks that exploit those specific vulnerabilities. The key issue addressed in this paper is whether movement towards such a market-based mechanism for vulnerabilities leads to a better social outcome? We study this problem by characterizing the behavior of software users benign and malign identifiers (or hackers).
A Low-Power Heterogeneous Multiprocessor Architecture for Audio Signal Processing
Authors: Özgün Paker, Jens Sparsø, Niels Haandbæk, Mogens Isager, Lars Skovby Nielsen
Venue: Journal of VLSI Signal Processing Systems (2004)

This paper describes a low-power programmable DSP architecture that targets audio signal processing. The architecture can be characterized as a heterogeneous multiprocessor consisting of small instruction set processors called mini-cores as well as standard DSP and CPU cores that communicate using message passing. The mini-cores are tailored for different classes of filtering algorithms (FIR, IIR, N-LMS etc.), and in a typical system the communication among processors occur at the sampling rate only.The mini-cores are intended as soft-macros to be used in the implementation of system-on-chip solutions using a synthesis-based design flow targeting a standard-cell implementation. They are parameterized in word-size, memory-size, etc. and can be instantiated according to the needs of the application. To give an impression of the size of a mini-core we mention that one of the FIR mini-cores in a prototype design has 16 instructions, a 32-word &times; 16-bit program memory, a 64-word &times; 16-bit data memory and a 25-word &times; 16-bit coefficient memory.Results obtained from the design of a prototype chip containing mini-cores for a hearing aid application, demonstrate a power consumption that is only 1.5&ndash;1.6 times larger than a hardwired ASIC and more than 6&ndash;21 times lower than current state of the art low-power DSP processors. This is due to: (1) the small size of the processors and (2) a smaller instruction count for a given task.
Technology: a threat to democracy
Authors: R. D. Parslow
Venue: ACM SIGCAS Computers and Society (1982)

"Short-term unemployment trends are likely . . . But far more critical are the long-term dangers of drastic population bipolarization. This would appear to generate a small minority of technologically oriented elitists against a vast majority of unskilled, nearly unemployable workers. This event, predicted by some and doubted by others, would probably represent the end of the road for contemporary Western civilization as now understood" (1)
Cooperative query processing via knowledge abstraction and query relaxation
Authors: Soon-Young Huh, Kae-Hyun Moon, Jin-Kyun Ahn
Venue: Advanced topics in database research vol. 1 (2003)

As database users adopt a query language to obtain information from a database, a more intelligent query answering system is increasingly needed that cooperates with the users to provide informative responses by understanding the intent behind a query. The effectiveness of decision support would improve significantly if the query answering system returned approximate answers rather than a null information response when there is no matching data available. Even when exact answers are found, neighboring information is still useful to users if the query is intended to explore some hypothetical information or abstract general fact. This chapter proposes an abstraction hierarchy as a framework to practically derive such approximate answers from ordinary everyday databases. It provides a knowledge abstraction database to facilitate the approximate query answering. The knowledge abstraction database specifically adopts an abstraction approach to extract semantic data relationships from the underlying database, and uses a multi-level hierarchy for coupling multiple levels of abstraction knowledge and data values. In cooperation with the underlying database, the knowledge abstraction database allows the relaxation of query conditions so that the original query scope can be broadened and thus information approximate to exact answers can be obtained. Conceptually abstract queries can also be posed to provide a less rigid query interface. A prototype system has been implemented at KAIST and is being tested with a personnel database system to demonstrate the usefulness and practicality of the knowledge abstraction database in ordinary database systems.
Fault modelling and fault equivalence in CMOS technology
Authors: M. L. Flottes, C. Landrault, S. Pravossoudovitch
Venue: Proceedings of the conference on European design automation (1990)

The need of greater confidence for fault coverage of test sequences for VLSI circuits has led to the proposal of more accurate fault models and test pattern generation tools. Such improvement induces a large increase in fault list to be considered and CPU time to generate test. In this paper, we propose a complete methodology to obtain a minimal set of faults. This methodology is based upon theoretical basis allowing the determination of the equivalence and dominance of non-classical CMOS faults.
Sales-Supporting E-services
Authors: Elisabeth van de Kar, Paulien Herder, Arjan Snijders, Wim Dik
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 3 - Volume 3 (2004)

In the ever-increasing number of services offered through the Internet channel, more sophisticated e-services can be found in the business-to-business market. In this paper we describe the selection and pilot of a B2B e-service in the firm GE Plastics Europe (GEP). The practical aim of the research was to get new customers by turning website visitors into commercial leads and to deliver better services to them. The scientific objective of our research was to develop and test an e-services quality model. We reviewed literature and developed an integrated Sales Supporting E-services Quality model (SSEQ model) consisting of the following components: technical reliability, functional reliability, responsiveness, userinterface, assurance, customisation, and empathy.We used the SSEQ model at GE Plastics for generating 36 new e-services (by means of brainstorming sessions and interviews), for pre-selecting e-services, for implementing one new e-service (Web Radar) in detail through a pilot, and finally for evaluating the e-service pilot. The Web Radar service allows a GEP employee to monitor real-time who is visiting the website. The employee can then offer a chat window to the customer in order to provide sales assistance. The chat acceptance rate in the pilot was 40%. GEP and the customers were satisfied with the results from the pilot study and GEP intends to implement the Web Radarcompany-wide.Overall, we found that the SSEQ model was very helpful in identifying potentially successful e-services by supporting the company in reviewing 36 e-services thoroughly ex ante. This ex ante evaluation is valuable given numerous failed initiatives related to the use ofInternet channels. Evidently, a high rating ex ante does not guarantee success, but it is expected to give better and more thorough insight into the e-services before implementing them full scale.
Relationships among trust in, satisfaction with, and loyalty toward web merchants among united states, dutch, and german consumers
Authors: Robert Joseph Tielman
Venue:  (2003)

The problem. The purpose of the study was to examine differences and similarities among U.S., Dutch, and German consumers' perceived trust in, satisfaction with, and loyalty toward Web merchants. Method. The research design was constructed using survey research. A self-administered online questionnaire was used to collect data from a convenience population of university students who had experience in purchasing products or services online. The descriptive study was used to describe, explain, compare, and evaluate the relationships among the effects of consumer demographic and consumer socialization factors on trust in, satisfaction with, and loyalty to Web merchants held by U.S., Dutch, and German consumers. Descriptive statistics were used to measure frequencies, percentages, means, and standard deviations of relevant data. Chi-square, analysis of variance, and Pearson's Correlation Coefficient tests were used to measure the differences, direction of the relationship, and the nature of the relationship among perceived trust in, satisfaction with, and loyalty toward Web merchants held by U.S., Dutch, and German consumers. Results. The study found significant differences (p < .05) among U.S., Dutch, and German consumers' perceptions of trust in, satisfaction with, and loyalty toward Web merchants. Demographic factors were age, gender, and culture. The study also found significant relationships among trust in, satisfaction with, and loyalty toward Web merchants and significant relationships among the consumer socialization factors of Internet accessibility, frequency of experience, prior experience, value of spending, referent influence, site factors, and reputation.
Asymmetric Cubature Formulae with Few Points in High Dimension for Symmetric Measures
Authors: Nicolas Victoir
Venue: SIAM Journal on Numerical Analysis (2004)

Let $\mu$ be a positive measure on $\mathbb{R}^d$ invariant under the group of reflections and permutations, and let m be a natural number. We describe a method to construct cubature formulae of degree m with respect to $\mu$, with n positive weights and n points in the support of $\mu$ and such that n grows at most like dm with the dimension d. We apply this method to classical measures to explicitly construct cubature formulae of degree 5 with the number of points growing at most like d3.
Algorithms of Nondifferentiable Optimization: Development and Application
Authors: N. Z. Shor, N. G. Zhurbenko, A. P. Likhovid, P. I. Stetsyuk
Venue: Cybernetics and Systems Analysis (2003)

A brief survey of nondifferentiable optimization methods developed at the Institute of Cybernetics is presented: the subgradient method, the subgradient method with space dilatation in the subgradient direction, and the r-algorithm. Applications of nondifferentiable optimization methods are considered.
Computers and politics in china
Venue: ACM SIGCAS Computers and Society (1979)

[After reading Andrew Gordon's articcle, we asked Prof. Tad Pinkerton, who is the Director of Academic Computing at the UW-Madison, to comment on the article. Tad had just spent the month of February, 1979, as a member of a faculty delegation visiting the Peoples Republic of China (PRC). The delegation, led by Chancellor Irving Shain of the UW--Madison, went to China to work out academic exchange programs between Chinese research institutes and universities and the UW--Madison. Their principal host in the PRC was the Chinese Academy of Sciences (Acadeia Sinica), but the delegation also met with officials of the Ministry of Education and the First Ministry of Machine-Building. The delegation visited more then two dozen universities and institutes in a four-city tour arranged for them by the Chinese Academy of Sciences. The tour also included an in depth look at both Nanking University, designated as the UW--Madison's sister university, and Hunan University in Changsha. A delegation from the First Ministry and Hunan University visited the UW-Madison for ten days in mid-April, 1979.In addition to his comments published below, Tad also recommended for those interested in this topic, the following two articles: (1) "Computing in China, 1978", by Harvey L. Garner, in the March, 1979 IEEE publication COMPUTER; and (2) "Snapshots of Computing in China", by Donald J. Reifer, in the March, 1979 issue of DAMATION. ED] 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
Complexity as a form of transition from dynamics to thermodynamics: application to sociological and biological processes
Authors: Massimiliano Ignaccolo
Venue:  (2003)

This dissertation addresses the delicate problem of establishing the statistical mechanical foundation of complex processes. These processes are characterized by a delicate balance of randomness and order, and a correct paradigm for them seems to be the concept of sporadic randomness. First of all, we have studied if it is possible to establish a foundation of these processes on the basis of a generalized version of thermodynamics, of non-extensive nature. A detailed account of this attempt is reported in Ignaccolo and Grigolini (2001), which shows that this approach leads to inconsistencies. It is shown that there is no need to generalize the Kolmogorov-Sinai entropy by means of a non-extensive indicator, and that the anomaly of these processes does not rest on their non-extensive nature, but rather in the fact that the process of transition from dynamics to thermodynamics, this being still extensive, occurs in an exceptionally extended time scale. Even, when the invariant distribution exists, the time necessary to reach the thermodynamic scaling regime is infinite. In the case where no invariant distribution exists, the complex system lives forever in a condition intermediate between dynamics and thermodynamics. This discovery has made it possible to create a new method of analysis of non-stationary time series which is currently applied to problems of sociological and physiological interest.
Algorithms for graphs with small octopus
Authors: Fedor V. Fomin, Dieter Kratsch, Haiko Müller
Venue: Discrete Applied Mathematics (2004)

A d-octopus of a graph G = (V,E) is a subgraph T = (W,F) of G such that W is a dominating set of G, and T is the union of d (not necessarily disjoint) shortest paths of G that have one endpoint in common. First, we study the complexity of finding and approximating a d-octopus of a graph. Then we show that for some NP-complete graph problems that are hard to approximate in general there are efficient approximation algorithms with worst case performance ratio c ċ d for some small constant c > 0 (depending on the problem) assuming that the input graph G is given together with a d-octopus of G. For example, there is a linear time algorithm to approximate the bandwidth of a graph within a factor of 8d. Furthermore, the minimum number of subsets in a partition of the vertex set of a graph into clusters of diameter at most k can be approximated in linear time within a factor of 3d (for k = 2) and 2d (for k ≥ 3). Finally, we show that there are O(n7d+2) time algorithms to compute a minimum cardinality dominating set, respectively, total dominating set for graphs having a d-octopus.
Designing for loose coupling in mobile groups
Authors: David Pinelle, Carl Gutwin
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

Loose coupling is a common way of organizing collaboration in work groups, but it has not been studied extensively in CSCW. In this paper, we consider the patterns of work that are seen in mobile groups that adopt a loosely coupled collaboration style. We report findings from interviews and fieldwork with teams of workers who deliver home healthcare services. In these teams, workers are mobile, widely dispersed, and autonomous, and team members communicate with each other only intermittently. Based on these findings, we identify and discuss four work patterns that occur in loosely coupled mobility: discretionary collaboration and effort thresholds, implicitly shared information, asynchronous communication and coordination, and barriers to synchrony. We consider the implications of these findings for the design of CSCW technologies.
Segmentation Given Partial Grouping Constraints
Authors: Stella X. Yu, Jianbo Shi
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--We consider data clustering problems where partial grouping is known a priori. We formulate such biased grouping problems as a constrained optimization problem, where structural properties of the data define the goodness of a grouping and partial grouping cues define the feasibility of a grouping. We enforce grouping smoothness and fairness on labeled data points so that sparse partial grouping information can be effectively propagated to the unlabeled data. Considering the normalized cuts criterion in particular, our formulation leads to a constrained eigenvalue problem. By generalizing the Rayleigh-Ritz theorem to projected matrices, we find the global optimum in the relaxed continuous domain by eigendecomposition, from which a near-global optimum to the discrete labeling problem can be obtained effectively. We apply our method to real image segmentation problems, where partial grouping priors can often be derived based on a crude spatial attentional map that binds places with common salient features or focuses on expected object locations. We demonstrate not only that it is possible to integrate both image structures and priors in a single grouping process, but also that objects can be segregated from the background without specific object knowledge.
Footprint Area Sampled Texturing
Authors: Baoquan Chen, Frank Dachille, Arie E. Kaufman
Venue: IEEE Transactions on Visualization and Computer Graphics (2004)

Abstract--We study texture projection based on a four region subdivision: magnification, minification, and two mixed regions. We propose improved versions of existing techniques by providing exact filtering methods which reduce both aliasing and overblurring, especially in the mixed regions. We further present a novel texture mapping algorithm called FAST (Footprint Area Sampled Texturing), which not only delivers high quality, but also is efficient. By utilizing coherence between neighboring pixels, performing prefiltering, and applying an area sampling scheme, we guarantee a minimum number of samples sufficient for effective antialiasing. Unlike existing methods (e.g., MIP-map, Feline), our method adapts the sampling rate in each chosen MIP-map level separately to avoid undersampling in the lower level l for effective antialiasing and to avoid oversampling in the higher level l+1 for efficiency. Our method has been shown to deliver superior image quality to Feline and other methods while retaining the same efficiency. We also provide implementation trade offs to apply a variable degree of accuracy versus speed.
A procedural interface to CAD data based on EDIF
Authors: T. C. O. Young, H. J. Kahn
Venue: Proceedings of the conference on European design automation (1990)

EDIF is a data interchange format which currently provides a solution to the problem of data transfer between proprietary CAD systems. This paper considers how a procedural interface to a CAD system may be built upon the underlying data model of EDIF.It outlines the procedural interface, and describes how a novel implementation has allowed access to, and extension of, the database to be particularly flexible, as well as allowing data management functions to be dynamically incorporated into it.
Rule-based spatiotemporal query processing for video databases
Authors: Mehmet Emin Dönderler, Özgür Ulusoy, Ugur Güdükbay
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (2004)

In our earlier work, we proposed an architecture for a Web-based video database management system (VDBMS) providing an integrated support for spatiotemporal and semantic queries. In this paper, we focus on the task of spatiotemporal query processing and also propose an SQL-like video query language that has the capability to handle a broad range of spatiotemporal queries. The language is rule-based in that it allows users to express spatial conditions in terms of Prolog-type predicates. Spatiotemporal query processing is carried out in three main stages: query recognition, query decomposition, and query execution.
Using Spanning Sets for Coverage Testing
Authors: Martina Marré, Antonia Bertolino
Venue: IEEE Transactions on Software Engineering (2003)

A test coverage criterion defines a set E_c of entities of the program flowgraph and requires that every entity in this set is covered under some test case. Coverage criteria are also used to measure the adequacy of the executed test cases. In this paper, we introduce the notion of spanning sets of entities for coverage testing. A spanning set is a minimum subset of E_c, such that a test suite covering the entities in this subset is guaranteed to cover every entity in E_c. When the coverage of an entity always guarantees the coverage of another entity, the former is said to subsume the latter. Based on the subsumption relation between entities, we provide a generic algorithm to find spanning sets for control flow and data flow-based test coverage criteria. We suggest several useful applications of spanning sets: They help reduce and estimate the number of test cases needed to satisfy coverage criteria. We also empirically investigate how the use of spanning sets affects the fault detection effectiveness.
An integrated network management framework using CORBA, mobile agents and web-based technologies
Authors: Dongming Cui, Jairo A. Gutiérrez
Venue: Information management: support systems & multimedia technology (2003)

Today's network management is still dominated by the platform-centered paradigm based on client/server technologies. This centralized approach has drawbacks in scalability, reliability, efficiency and flexibility, and is unsuitable for large and heterogenerous networks. Modern networks require an open management architecture, which can provide standard interfaces for information sharing among management systems, has extensibility for handling change quickly, and has means to manage large networks. Emerging technologies such as Web-, CORBA-, and Mobile Agent-based technologies represent an excellent opportunity to solve these problems. In this chapter a new Web-based network management framework is proposed, which combines the strengths of these novel ways of managing networks and the results of a prototype implementation are discussed. Our preliminary results indicate that the integration of Web-, CORBA-, and Mobile Agent-based technologies within an Integrated Network Management System framework can dramatically improve the performance of the networked environment.