CORR 2002 - PDF Preprint Papers

CORR 2002 Workshop on Service Oriented Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CORR-2002 Paper

click to vote

CORR
2002
Springer

255views Education» more CORR 2002»

Components of an NSDL Architecture: Technical Scope and Functional Model

13 years 11 months ago

Download www.alexandria.ucsb.edu

We describe work leading toward specification of a technical architecture for the National Science, Mathematics, Engineering, and Technology Education Digital Library (NSDL). This...

David Fulker, Greg Janee

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	255	Components of an NSDL Architecture: Technical Scope and Functional Model	claim
2	210	Correction to Low and Lapsley's article "Optimization Flow Control, I: Basic Algorithm and Convergence"	claim
3	188	GridBank: A Grid Accounting Services Architecture (GASA) for Distributed Systems Sharing and Integration	claim
4	187	Answer Sets for Consistent Query Answering in Inconsistent Databases	claim
5	180	Non-negative sparse coding	claim
6	175	Creating Annotation Tools with the Annotation Graph Toolkit	claim
7	175	A continuation semantics of interrogatives that accounts for Baker's ambiguity	claim
8	169	On the existence and multiplicity of extensions in dialectical argumentation	claim
9	166	Quantum Time-Space Tradeoffs for Sorting	claim
10	160	Structure from Motion: Theoretical Foundations of a Novel Approach Using Custom Built Invariants	claim
11	159	Complexity of Mechanism Design	claim
12	156	MPICH-G2: A Grid-Enabled Implementation of the Message Passing Interface	claim
13	156	Mapping the Gnutella Network: Properties of Large-Scale Peer-to-Peer Systems and Implications for System Design	claim
14	148	Classes of Spatiotemporal Objects and Their Closure Properties	claim
15	144	Polynomial Time Data Reduction for Dominating Set	claim
16	143	Bidding Clubs in First-Price Auctions	claim
17	142	Learning Algorithms for Keyphrase Extraction	claim
18	141	Question answering: from partitions to Prolog	claim
19	139	Symbolic Methodology in Numeric Data Mining: Relational Techniques for Financial Applications	claim
20	137	On ASGS framework: general requirements and an example of implementation	claim
21	136	Libra: An Economy driven Job Scheduling System for Clusters	claim
22	135	Minimal-Change Integrity Maintenance Using Tuple Deletions	claim
23	135	Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs	claim
24	135	An Architecture for Making Object-Oriented Systems Available from Prolog	claim
25	133	Sequential and Parallel Algorithms for Mixed Packing and Covering	claim
26	133	Complete Axiomatizations for Reasoning About Knowledge and Time	claim
27	133	Declarative program development in Prolog with GUPU	claim
28	132	Nonmonotonic Reasoning, Preferential Models and Cumulative Logics	claim
29	132	Robust Feature Selection by Mutual Information Distributions	claim
30	132	Edsger Wybe Dijkstra (1930 - 2002): A Portrait of a Genius	claim
31	132	Exploiting Synergy Between Ontologies and Recommender Systems	claim
32	131	Logic Programming with Ordered Disjunction	claim
33	131	A Connection-Centric Survey of Recommender Systems Research	claim
34	131	Ownership Confinement Ensures Representation Independence for Object-Oriented Programs	claim
35	128	The Deductive Database System LDL++	claim
36	126	Unsupervised Discovery of Morphemes	claim
37	126	Eavesdropping on Electronic Guidebooks: Observing Learning Resources in Shared Listening Environments	claim
38	125	Greedy Facility Location Algorithms Analyzed using Dual Fitting with Factor-Revealing LP	claim
39	125	Complexity of Manipulating Elections with Few Candidates	claim
40	123	Survey propagation: an algorithm for satisfiability	claim
41	123	Ideal decompositions and computation of tensor normal forms	claim
42	122	Fair Stateless Aggregate Traffic Marking using Active Queue Management Techniques	claim
43	122	On alternative approach for verifiable secret sharing	claim
44	121	Answering Subcognitive Turing Test Questions: A Reply to French	claim
45	120	A Comparison of Different Cognitive Paradigms Using Simple Animats in a Virtual Laboratory, with Implications to the Notion of Cognition	claim
46	119	Composing Programs in a Rewriting Logic for Declarative Programming	claim
47	118	Unsupervised discovery of morphologically related words based on orthographic and semantic similarity	claim
48	118	Japanese/English Cross-Language Information Retrieval: Exploration of Query Translation and Transliteration	claim
49	118	Language Modeling for Multi-Domain Speech-Driven Text Retrieval	claim
50	118	On-Line Paging against Adversarially Biased Random Inputs	claim
51	118	Instabilities of Robot Motion	claim
52	117	On the graph coloring check-digit scheme with applications to verifiable secret sharing	claim
53	117	Detecting Race Conditions in Parallel Programs that Use Semaphores	claim
54	117	Contextual Normalization Applied to Aircraft Gas Turbine Engine Diagnosis	claim
55	117	Computing stable models: worst-case performance estimates	claim
56	115	Linking Makinson and Kraus-Lehmann-Magidor preferential entailments	claim
57	115	Simultaneous Embedding of a Planar Graph and Its Dual on the Grid	claim
58	115	Average-case complexity and decision problems in group theory	claim
59	114	Offline Specialisation in Prolog Using a Hand-Written Compiler Generator	claim
60	113	Evolution and Gravitation: a Computer Simulation of a Non-Walrasian Equilibrium Model	claim
61	113	Robust Global Localization Using Clustered Particle Filtering	claim
62	113	Generic-case complexity, decision problems in group theory and random walks	claim
63	112	Introduction to the CoNLL-2002 Shared Task: Language-Independent Named Entity Recognition	claim
64	112	A Calculus for End-to-end Statistical Service Guarantees	claim
65	112	Determination of the structure of algebraic curvature tensors by means of Young symmetrizers	claim
66	111	The Fastest and Shortest Algorithm for All Well-Defined Problems	claim
67	111	Increasing Evolvability Considered as a Large-Scale Trend in Evolution	claim
68	110	Long Proteins with Unique Optimal Foldings in the H-P Model	claim
69	109	Sufficiently Fat Polyhedra are not 2-castable	claim
70	108	Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way	claim
71	108	Combinatorial Auctions with Decreasing Marginal Utilities	claim
72	108	Vote Elicitation: Complexity and Strategy-Proofness	claim
73	108	Learning to Play Games in Extensive Form by Valuation	claim
74	108	Analysis of a Cone-Based Distributed Topology Control Algorithm for Wireless Multi-hop Networks	claim
75	106	Domain-Dependent Knowledge in Answer Set Planning	claim
76	106	On model selection and the disability of neural networks to decompose tasks	claim
77	105	The Basque task: did systems perform in the upperbound?	claim
78	105	Cooperation between Pronoun and Reference Resolution for Unrestricted Texts	claim
79	105	Petabyte Scale Data Mining: Dream or Reality?	claim
80	105	Effectiveness of Preference Elicitation in Combinatorial Auctions	claim
81	104	Preprocessing Chains for Fast Dihedral Rotations Is Hard or Even Impossible	claim
82	104	Generalized Cores	claim
83	104	Intelligent Search of Correlated Alarms for GSM Networks with Model-based Constraints	claim
84	104	Design Patterns for Functional Strategic Programming	claim
85	103	Optimal network topologies for local search with congestion	claim
86	103	Analysis of Non-Gaussian Nature of Network Traffic	claim
87	102	Tight Approximation Results for General Covering Integer Programs	claim
88	102	Randomized protocols for asynchronous consensus	claim
89	102	Low Size-Complexity Inductive Logic Programming: The East-West Challenge Considered as a Problem in Cost-Sensitive Classification	claim
90	102	Quantum Lower Bound for Recursive Fourier Sampling	claim
91	101	A correct proof of the heuristic GCD algorithm	claim
92	101	Semantic Component Composition	claim
93	101	Quantum Circuits with Unbounded Fan-out	claim
94	100	Making Abstract Domains Condensing	claim
95	100	A neural model for multi-expert architectures	claim
96	99	Internet topology at the router and autonomous system level	claim
97	99	Spatial Clustering of Galaxies in Large Datasets	claim
98	99	Coin-Moving Puzzles	claim
99	99	The Identification of Context-Sensitive Features: A Formal Definition of Context for Concept Learning	claim
100	99	Intersection Types and Lambda Theories	claim
101	99	Nonmonotonic inference operations	claim
102	98	A Framework for Compiling Preferences in Logic Programs	claim
103	98	Two Representations for Iterative Non-prioritized Change	claim
104	98	An Empirical Model for Volatility of Returns and Option Pricing	claim
105	98	Compact Floor-Planning via Orderly Spanning Trees	claim
106	98	Efficient Tree Layout in a Multilevel Memory Hierarchy	claim
107	98	Fast optical layer mesh protection using pre-cross-connected trails	claim
108	97	Local Search in Unstructured Networks	claim
109	97	Classification of Random Boolean Networks	claim
110	97	Bootstrapping Lexical Choice via Multiple-Sequence Alignment	claim
111	97	Fast Hands-free Writing by Gaze Direction	claim
112	97	Thumbs Up or Thumbs Down? Semantic Orientation Applied to Unsupervised Classification of Reviews	claim
113	97	Computing the Noncomputable	claim
114	96	Thinking Adaptive: Towards a Behaviours Virtual Laboratory	claim
115	96	Models and Tools for Collaborative Annotation	claim
116	96	Thumbs up? Sentiment Classification using Machine Learning Techniques	claim
117	96	A computer scientist looks at game theory	claim
118	96	Precongruence Formats for Decorated Trace Semantics	claim
119	96	Reinforcing Reachable Routes	claim
120	96	The Sketch of a Polymorphic Symphony	claim
121	96	Soft Concurrent Constraint Programming	claim
122	95	Value Based Argumentation Frameworks	claim
123	95	On the survey-propagation equations for the random K-satisfiability problem	claim
124	95	An Integrated Framework for Treebanks and Multilayer Annotations	claim
125	95	Phonology	claim
126	95	Unsupervised Learning of Morphology without Morphemes	claim
127	95	A Polynomial Description of the Rijndael Advanced Encryption Standard	claim
128	95	Types of Cost in Inductive Concept Learning	claim
129	95	Qualitative Visualization of Distance Information	claim
130	94	Self-Optimizing and Pareto-Optimal Policies in General Environments based on Bayes-Mixtures	claim
131	93	Modeling Complex Domains of Actions and Change	claim
132	93	On the Reflexivity of Point Sets	claim
133	93	Open Problems from CCCG 2002	claim
134	93	Ellogon: A New Text Engineering Platform	claim
135	93	Synthesis of Low-Power Digital Circuits Derived from Binary Decision Diagrams	claim
136	93	Secure History Preservation Through Timeline Entanglement	claim
137	93	Logic program specialisation through partial deduction: Control issues	claim
138	92	Computational complexity arising from degree correlations in networks	claim
139	92	When to Update the sequential patterns of stream data?	claim
140	92	Bundling Equilibrium in Combinatorial auctions	claim
141	92	Source Routing and Scheduling in Packet Networks	claim
142	92	Neutrality: A Necessity for Self-Adaptation	claim
143	91	Data Engineering for the Analysis of Semiconductor Manufacturing Data	claim
144	91	Minimum-Energy Mobile Wireless Networks Revisited	claim
145	91	Quantum Random Walks Hit Exponentially Faster	claim
146	90	Mostly-Unsupervised Statistical Segmentation of Japanese Kanji Sequences	claim
147	90	Hypercomputation: computing more than the Turing machine	claim
148	89	NetNeg: A Connectionist-Agent Integrated System for Representing Musical Knowledge	claim
149	89	A Spectrum of Applications of Automated Reasoning	claim
150	88	SPINning Parallel Systems Software	claim
151	87	Ultimate approximations in nonmonotonic knowledge representation systems	claim
152	87	A variable-free dynamic semantics	claim
153	87	Rerendering Semantic Ontologies: Automatic Extensions to UMLS through Corpus Analytics	claim
154	87	Myths and Legends of the Baldwin Effect	claim
155	87	Packet delay in models of data networks	claim
156	86	Small Strictly Convex Quadrilateral Meshes of Point Sets	claim
157	86	Practical Strategies for Integrating a Conversation Analyst in an Iterative Design Process	claim
158	86	The Management of Context-Sensitive Features: A Review of Strategies	claim
159	85	Anticipatory Guidance of Plot	claim
160	85	Intuitions and the modelling of defeasible reasoning: some case studies	claim
161	85	Distance function wavelets - Part III: "Exotic" transforms and series	claim
162	85	The partition semantics of questions, syntactically	claim
163	84	Evaluating the Effectiveness of Ensembles of Decision Trees in Disambiguating Senseval Lexical Samples	claim
164	84	A Method for Open-Vocabulary Speech-Driven Text Retrieval	claim
165	84	Use of openMosix for parallel I/O balancing on storage in Linux cluster	claim
166	83	Optimal Ordered Problem Solver	claim
167	82	Using eigenvectors of the bigram graph to infer morpheme identity	claim
168	82	Data Mining the SDSS SkyServer Database	claim
169	82	Truth Revelation in Approximately Efficient Combinatorial Auctions	claim
170	81	Towards practical meta-querying	claim
171	81	Economic-based Distributed Resource Management and Scheduling for Grid Computing	claim
172	81	Value withdrawal explanations: a theoretical tool for programming environments	claim
173	80	Behaviour-based Knowledge Systems: An Epigenetic Path from Behaviour to Knowledge	claim
174	80	Gales Suffice for Constructive Dimension	claim
175	80	TerraService.NET: An Introduction to Web Services	claim
176	80	Extraction of Keyphrases from Text: Evaluation of Four Algorithms	claim
177	79	Dual reciprocity BEM and dynamic programming filter for inverse elastodynamic problems	claim
178	79	Optimally cutting a surface into a disk	claim
179	79	Multidimensional Network Monitoring for Intrusion Detection	claim
180	79	Improved Bicriteria Existence Theorems for Scheduling	claim
181	79	Sharpening Occam's Razor	claim
182	79	Technical Note: Bias and the Quantification of Stability	claim
183	78	Linear-Time Algorithms for Computing Maximum-Density Sequence Segments with Bioinformatics Applications	claim
184	78	Preemptive Scheduling of Equal-Length Jobs to Maximize Weighted Throughput	claim
185	77	A Dynamic Approach to Characterizing Termination of General Logic Programs	claim
186	76	PRIME: A System for Multi-lingual Patent Retrieval	claim
187	76	Topological robotics: motion planning in projective spaces	claim
188	76	Quantum Zero-Error Algorithms Cannot be Composed	claim
189	75	Sampling Strategies for Mining in Data-Scarce Domains	claim
190	75	Locating Data in (Small-World?) Peer-to-Peer Scientific Collaborations	claim
191	75	Learning to Extract Keyphrases from Text	claim
192	74	A logical reconstruction of SPKI	claim
193	74	Web Services for the Virtual Observatory	claim
194	73	Knowledge Representation	claim
195	73	Separating Thickness from Geometric Thickness	claim
196	72	Using the Annotated Bibliography as a Resource for Indicative Summarization	claim
197	72	Unsupervised Language Acquisition: Theory and Practice	claim
198	71	Seven Dimensions of Portability for Language Documentation and Description	claim
199	71	Towards Generic Refactoring	claim
200	67	The prospects for mathematical logic in the twenty-first century	claim
201	63	Robust Classification with Context-Sensitive Features	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers