ppxscal/embedding_network huggingface dataset:
A customizable hybrid approach to data clustering
Authors: Yu Qian, Kang Zhang
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Most current data clustering algorithms in data mining are based on a distance calculation in certain metric space. For Spatial Database Systems (SDBS), the Euclidean distance between two data points is often used to represent the relationship between data points. However, in some spatial settings and many other applications, distance alone is not enough to represent all the attributes of the relation between data points. We need a more powerful model to record more relational information between data objects. This paper adopts a graph model by which a database is regarded as a graph: each vertex of the graph represents a data point, and each edge, weighted or unweighted, is used to record the relation between two data points connected by the edge. Based on the graph model, this paper presents a set of cluster analysis criteria to guide data clustering. The criteria can be used to measure clustering results and help improving the quality of clustering. Further, a customizable algorithm using the criteria is proposed and implemented. This algorithm can produce clusters according to users' specifications. Preliminary experiments show encouraging results.
Techniques for the design of communicating processes
Authors: Sylvie Damy, Guy-René Perrin
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

These last few years have seen the development of many parallel architectures. Among them, Distributed Memory Parallel Computers seem to be very promizing. The programmation of these machines requires to design processes to be mapped on the nodes, communicating by message passing along the links of the architecture. The aim of this paper is to give a contribution for a rationalized design of such programs, by defining refinement techniques.
Repositories for CS courses: an evolutionary tale
Authors: Edward L. Jones, Clement S. Allen
Venue: Proceedings of the 8th annual conference on Innovation and technology in computer science education (2003)

This paper describes a simple Unix-based repository that supports programming intensive courses. Initially motivated by the need to capture sample artifacts for the capstone course sequence, the repository has evolved to support progam submission, on-line testing, and automated program grading. Repository features enforce naming conventions, assignment due dates, while supporting the use of Unix in programming classes. The repository also facilitates consistent on-line program compilation and execution. Repository utilities are provided to support first-time adoption, for archiving repositories from past terms, and for establishing repositories for a new academic term. Results from the transfer of the technology to first-time adopters are presented.
Data-gathering wireless sensor networks: organization and capacity
Authors: Enrique J. Duarte-Melo, Mingyan Liu
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

In this paper we study the transport capacity of a data-gathering wireless sensor network under different communication organizations. In particular, we consider using a flat as well as a hierarchical/clustering architecture to realize many-to-one communications. The capacity of the network under this many-to-one data-gathering scenario is reduced compared to random one-to-one communication due to the unavoidable creation of a point of traffic concentration at the data collector/receiver. We introduce the overall throughput bound of λ = W/n per node, where W is the transmission capacity, and show under what conditions it can be achieved and under what conditions it cannot. When those conditions are not met, we constructively show how λ = Θ(W/n) is achieved with high probability as the number of sensors goes to infinity. We also show how the introduction of clustering can improve the throughput. We discuss the trade-offs between achieving capacity and energy consumption, how transport capacity might be affected by considering in-network processing and the implications this study has on the design of practical protocols for large-scale data-gathering wireless sensor networks.
A 0.18 µm CMOS Implementation of On-chip Analogue Test Signal Generation from Digital Test Patterns
Authors: Luis Rolíndez, Salvador Mir, Guillaume Prenat, Ahcène Bounceur
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

The test of Analogue and Mixed-Signal (AMS) cores requires the use of expensive AMS testers and accessibility to internal analogue nodes. The test cost can be considerably reduced by the use of Built-In-Self-Test (BIST) techniques. One of these techniques consists in generating analogue test signals from digital test patterns (obtained via [Sigma-Delta] modulation) and converting the responses of the analogue modules into digital signatures that are compared with the expected ones. This paper presents an implementation of the analogue test signal generation part that includes programmability of the circuit blocks, leading to animprovement of performance and a reduction of circuit size with respect to previous approaches. A 0.18 µm CMOS circuit has been designed and fabricated, allowing the generation of test signals ranging from 10 Hz to 1 MHz.
Syntactical truth predicates for formulas with atomic negation
Authors: Loic Colson
Venue: Mathematical Structures in Computer Science (2002)

We define a language for second-order arithmetic using the (positive) connectives &and; and &or;, the (positive) quantifiers &forall; and &exist;, and with negation &lsquo;pushed to the atoms&rsquo; under the form of atomic formula t&esdot;u, t&ne;u, t&isin;X, t&isin;X where t and u stand for first-order terms and X for a second-order variable.We define and study the translation from this language to the more usual implicational language containing the entailment connective &rarr;. We also study the converse translation. Next we define the appropriate notion of syntactical truth predicate for this language (such a notion has been introduced for the implicational language in Colson and Grigorieff (1998)). We establish using the previous translations that the existence of such a predicate for this language is equivalent to the the existence of such a predicate for the implicational language. This result is established in a predicative formal system. We conclude by discussing some elementary attempts to construct such a truth predicate by a fixed point technique.
&#x22A4;&#x22A4;-closed relations and admissibility
Authors: Martín Abadi
Venue: Mathematical Structures in Computer Science (2000)

While developing a method for reasoning about programs, Pitts defined the &top;&top;-closed relations as an alternative to the standard admissible relations. This paper reformulates and studies Pitts's operational concept of &top;&top;-closure in a semantic framework. It investigates the non-trivial connection between &top;&top;-closure and admissibility, showing that &top;&top;-closure is strictly stronger than admissibility and that every &top;&top;-closed relation corresponds to an admissible preorder.
The experience of first-year college students using computer technology
Authors: John Dirkx
Venue:  (2003)

Revolutionary changes associated with technology in higher education continue with little conclusive research that adequately explains how students experience computer technology during their first year of college. In this qualitative study, the researcher investigated the experience of first year college students using computer technology at a large land-grant research university. Two research questions guided the research: (1) What is the experience of first year college students using computer technology? (2) What types of computer experiences do students describe as important to master in order to be successful their first year of college? This research involved the use of anonymous questionnaires, face-to-face interviews, and focus group discussions. The data indicate that the participants in this study had a wide range of abilities and experiences related to computer technology when they arrived on campus as first year students. There was a broad continuum of experience demonstrated by those who knew how to use computer technology successfully and those who did not. The patterns that emerged from the participant responses were categorized according to four types of interactions which have been described as: (1) Learner-Content, (2) Learner-Instructor, (3) Learner-Learner, and (4) Learner-Interface according to Michael Moore (1989) and Hillman, Hills, and Gunawardena (1994). This study found there are many variables that determine the experience that a student has using technology prior to starting the first year of college. Some of these include racial, ethnic, gender, cultural, and religious differences that influence the experience that students report using computer technology. These differences may create obstacles for some first year college students that do not exist for others. Participants suggested that some African-American students, specifically males, may be disadvantaged because of limited experience with computer technology. Some international students may also be at a disadvantage due to limited or negative experiences using computers. Regardless of their past experience using technology, participants in this study suggested that for first year students to be academically successful at Michigan State University, they need certain computer related knowledge and competencies. There is a continued need for higher education to identify strategic objectives and goals regarding how students will experience technology during their first year. The results of this study contribute to the body of knowledge which will help inform decision makers, researchers, and other educators about the experiences that first year students are having with technology.
An annotation system for 3D fluid flow visualization
Authors: Maria M. Loughlin, John F. Hughes
Venue: Proceedings of the conference on Visualization '94 (1994)

Annotation is a key activity of data analysis. However, current data analysis systems focus almost exclusively on visualization. We propose a system which integrates annotations into a visualization system. Annotations are embedded in 3D data space, using the Post-it1 metaphor. This embedding allows contextual-based information storage and retrieval, and facilitates information sharing in collaborative environments. We provide a traditional database filter and a Magic Lens2 filter to create specialized views of the data. The system is customized for fluid flow applications, with features which allow users to store parameters of visualization tools and sketch 3D volumes.
A multiple-application conversational agent
Authors: Steven Ross, Elizabeth Brownholtz, Robert Armes
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

In this paper, we describe the rationale behind and architecture of a conversational agent capable of speech enabling multiple applications.
On Benchmarking Constraint Logic Programming Platforms. Response to Fernandez and Hill's &ldquo;A Comparative Study of Eight Constraint Programming Languages over the Boolean and Finite Domains&rdquo;
Authors: Mark Wallace, Joachim Schimpf, Kish Shen, Warwick Harvey
Venue: Constraints (2004)

The comparative study published in this journal by Fernandez and Hill benchmarked some constraint programming systems on a set of well-known puzzles. The current article examines the positive and negative aspects of this kind of benchmarking.The article analyses some pitfalls in benchmarking, recalling previous published results from benchmarking different kinds of software, and explores some issues in comparative benchmarking of CLP systems.A benchmarking exercise should cover a broad set of representative problems and a broad set of programming constructs. This can be achieved using two kinds of benchmarking: Applications Benchmarking and Unit Testing. The article reports the authors' experiences with these two kinds of benchmarking in the context of the CHIC2 Esprit project. The benchmarks were used to unit test different features of the CLP system ECLiPSe and to compare application development with different high-level constraint platforms.The conclusion is that, in deciding which system to use on a new application, it is less useful to compare standard features of CLP systems, than to compare their relevant functionalities.
MARP: A Multi-Agent Routing Protocol for Mobile Wireless Ad Hoc Networks
Authors: Romit Roy Choudhury, Krishna Paul, Somprakash Bandyopadhyay
Venue: Autonomous Agents and Multi-Agent Systems (2004)

Supporting mobility in a multi hop wireless environment like the MANET still remains a point of research, especially in the context of time-constrained applications. The incapacity of ad hoc networks to offer services of the likes of static or infratructured networks may be attributed to two major reasons. One, unpredictable mobility of hosts cause location-transparent-packet-delivery to be implemented only at the expense of large control overhead. Two, the lack of central control causes connection management and scalability to be major problems in the multi hop environment. In this paper we propose an efficient agent based routing mechanism that not only incurs minimal overhead, but also lays the foundation for additional functionalities as network management and real time applications. In other words, we show that the agent framework makes the MANET robust and survivable under stringent system constraints.
Scheduling Nodes in Wireless Sensor Networks: A Voronoi Approach
Authors: Marcos Augusto M. Vieira, Luiz Filipe M. Vieira, Linnyer B. Ruiz, Antonio A. F. Loureiro, Antonio O. Fernandes, José Marcos S. Nogueira
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

A wireless sensor network is a special kind of ad-hoc networkwith distributed sensing and processing capability thatcan be used in a wide range of applications, such as environmentalmonitoring, industrial applications and precisionagriculture. Despite their potential applications, suchnetworks have particular features imposed by resource restrictions,such as low computational power, reduced bandwidthand specially limited power source. In case of a networkwith a high density of sensor nodes, some problemsmay arise such as the intersection of sensing area, redundantdata, communication interference, and energy waste.A management application is necessary to make the most ofnetwork resources. On the other hand, a high-density networkcan introduce a fault-tolerant mechanism, increaseprecision, and provide multi-resolution data. The networkdensity control depends on the application. In this paper, wepropose a method to set up which nodes should be turned offor on. The management may take the sensor node out of servicetemporally. Our design uses a Voronoi Diagram, whichdecomposes the space into regions around each node. Thatschema could be used in a management architecture for awireless sensor network.
Structure free highway toll collection using non-repudiated tickets
Authors: Nol Premasathian, Somying Thainimit
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

This paper proposes a concept of how to collect toll on highways. Unlike any existing method, the proposed approach requires no structure to be built on highways for the toll collection purpose and drivers are not required to stop or even slow down to pay toll. Toll must be prepaid in advance and a driver must keep a toll ticket as proof of payment. We apply public key cryptographic operations to the ticket issuing system to prevent forgery as well as repudiation from the seller. This paper explains the mechanism of the system: the details of toll tickets issuance, the detection and penalization of drivers without a toll ticket, the prevention of toll ticket reproduction by involved parties, and the detection of an agent selling toll ticket for his own benefit.
A Switch-Cap Regulator for SoC Applications
Authors: Nitin Bansal, Amit Katyal
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Switch-Cap Regulators are generally available asdiscrete devices and are used mainly for obtaining higherefficiency when compared to the low-efficiency linearregulators. In this paper, we present a Switch-CapRegulator specifically designed for SoC applications. Thedesigned regulator should meet some stringentrequirements to be able to be incorporated in SoCs, someof them being able to limit the startup current to a safevalue and obey the EMC requirements of electricaldevices.
Inquiry into definitions of culture in IT studies
Authors: Mark Srite, Detmar Straub, Karen Loch, Roberto Evaristo, Elena Karahanna
Venue: Advanced topics in global information management (2003)

In reviewing the history of the conceptualization and measurement of "culture," one quickly realizes that there is wide-ranging and contradictory scholarly opinion about which values, norms, and beliefs should be measured to represent the concept of "culture." We explore an alternate theory-based view of culture via social identity theory (SIT), which suggests that each individual is influenced by a plethora of cultures and sub-cultures - some ethnic, some national, and some organizational. In information system (IS) research, the culture of subjects and respondents is problematic because it is typically an overly simplistic categorization. IS research nearly always assumes that an individual living in a particular place and time belongs to a single "culture," e.g., someone living in Egypt is automatically classified as being a member of the Egyptian culture, or, more broadly, the Arab culture. This dearth of clear concepts and measures for "culture" may explain why cross-cultural research has been so exceedingly difficult to conduct. It may also explain why it has been hard to develop and refine theories. Moreover, it may give insight into why reasonable, explained variance in predictive models has not been higher. Finally, it is very possible that much cross-cultural business research could be rightly accused of advancing an "ecological fallacy" by not recognizing the individual makeup of persons with respect to culture. Using SIT (or other theory bases) as grounding for cultural research programs implies the use of certain methodological approaches. Each study would have to establish the salient "cultures" in each individual's background and include these different "cultures" as independent variables in positivist research. In qualitative research, there would need to be an equally rigorous assessment of the cultural identifiers of each individual.
Combinatorial Nullstellensatz
Authors: Noga Alon
Venue: Combinatorics, Probability and Computing (1999)

We present a general algebraic technique and discuss some of its numerous applications in combinatorial number theory, in graph theory and in combinatorics. These applications include results in additive number theory and in the study of graph colouring problems. Many of these are known results, to which we present unified proofs, and some results are new.
On the complexity and some properties of multi-stage scheduling problems with earliness and tardiness penalties
Authors: Volker Lauff, Frank Werner
Venue: Computers and Operations Research (2004)

In this paper, the complexity and some other properties of several multi-stage problems with a nonregular performance measure are investigated. Mainly, we deal with two-machine problems. The problems are extensions of a one-machine problem with a common due date and a non-regular optimization criterion, where the sum of absolute deviations of the completion times from the due date is to be minimized. There are two reasonable generalizations: Either, the objective function is kept the same as in the one-machine problem, where the completion time is now the completion time of the last operation of the job, or a second penalty is added to this term which takes into account the storage costs of the intermediate. For both types of problems, we study the flow shop, the job shop, and the open shop environment. In the case of intermediate storage costs, we distinguish the cases of a due date d = 0 (which leads to a regular optimization criterion) and a non-restrictive due date. We obtain the following results. The two-machine flow shop problem with intermediate storage costs defined in this paper is NP-hard in the strong sense for d = 0 as well as for a nonrestrictive due date. We prove the similar results for the two-machine open shop problem. In absence of intermediate storage costs, the open shop and the job shop problem are polynomially solvable for a non-restrictive due date.
Six Sigma for Software Application of Hypothesis Tests to Software Data
Authors: Krishna Arul, Harsh Kohli
Venue: Software Quality Control (2004)

The article discusses statistical analysis on Release data from a mature Global Software Group (GSG) with three business domains with an aim to ascertain if any correlation can be established between the data collected after release and the benefits to the centre from the outcome of the analysis. Thus re-evaluating the process involved in creating and delivering software products to our customers. This article will strive to explain some of the Six Sigma methodologies and tools used in comparing groups (ANOVA method) and categorical data analysis techniques on software data. The paper will also discuss in detail normal distribution, tests for normality and comparative methods along with Contingency Table Analysis (Mosaic plots) and Correspondence Analysis. The application of statistics for SOFTWARE process improvement is increasing in the industry; we present how these techniques can be applied in practice.
Future temporal logic needs infinitely many modalities
Authors: Yoram Hirshfeld, Alexander Rabinovich
Venue: Information and Computation (2003)

Kamp's theorem states that there is a temporal logic with two modalities ("until" and "since") which is expressively complete for the first-order monadic logic of order over the real line. In this paper we show that there is no temporal logic with finitely many modalities which is expressively complete for the future fragment of first-order monadic logic of order over the real line (a future formula over the real time line is a formula whose truth value at a point is independent of what happened in the past).
Digital Ground Bounce Reduction by Phase Modulation of the Clock
Authors: Mustafa Badaroglu, Piet Wambacq, Geert Van der Plas, Stéphane Donnay, Georges Gielen, Hugo De Man
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

The digital switching noise that propagates through the chip substrate to the analog circuitry on the same chip is a major limitation for mixed-signal SoC integration. In synchronous digital systems, digital circuits switch simultaneously on the clock edge, hereby generating a large ground bounce. In order to reduce the spectral peaks in the ground bounce spectrum, we combine the two techniques: (1) phase modulation of the clock and (2) introducing intended clock skews to spread the switching activities. Experimental results show around 16 dB reduction in the spectral peaks of the noise spectrum when these two techniques are combined. These two techniques are believed to be good candidates for the development ofmethodologies for digital low-noise design techniques in future CMOS technologies.