id
stringlengths 9
10
| submitter
stringlengths 2
52
⌀ | authors
stringlengths 4
6.51k
| title
stringlengths 4
246
| comments
stringlengths 1
523
⌀ | journal-ref
stringlengths 4
345
⌀ | doi
stringlengths 11
120
⌀ | report-no
stringlengths 2
243
⌀ | categories
stringlengths 5
98
| license
stringclasses 9
values | abstract
stringlengths 33
3.33k
| versions
list | update_date
timestamp[s] | authors_parsed
list | prediction
stringclasses 1
value | probability
float64 0.95
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
0805.0885
|
EDA Publishing Association
|
A. G. G. Toh, Z. F. Wang, S.H. Ng
|
Fabrication of Embedded Microvalve on PMMA Microfluidic Devices through
Surface Functionalization
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The integration of a PDMS membrane within orthogonally placed PMMA
microfluidic channels enables the pneumatic actuation of valves within bonded
PMMA-PDMS-PMMA multilayer devices. Here, surface functionalization of PMMA
substrates via acid catalyzed hydrolysis and air plasma corona treatment were
investigated as possible techniques to permanently bond PMMA microfluidic
channels to PDMS surfaces. FTIR and water contact angle analysis of
functionalized PMMA substrates showed that air plasma corona treatment was most
effective in inducing PMMA hydrophilicity. Subsequent fluidic tests showed that
air plasma modified and bonded PMMA multilayer devices could withstand fluid
pressure at an operational flow rate of 9 mircoliters/min. The pneumatic
actuation of the embedded PDMS membrane was observed through optical microscopy
and an electrical resistance based technique. PDMS membrane actuation occurred
at pneumatic pressures of as low as 10kPa and complete valving occurred at
14kPa for 100 micrometers x 100 micrometers channel cross-sections.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 09:09:11 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Toh",
"A. G. G.",
""
],
[
"Wang",
"Z. F.",
""
],
[
"Ng",
"S. H.",
""
]
] |
new_dataset
| 0.994342 |
0805.0889
|
EDA Publishing Association
|
B. Charlot (IES), W. Sun, K. Yamashita, H. Fujita, H. Toshiyoshi
|
In-Plane Bistable Nanowire For Memory Devices
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We present a nanomechanical device design to be used in a non-volatile
mechanical memory point. The structure is composed of a suspended slender
nanowire (width : 100nm, thickness 430nm length : 8 to 30$\mu$m) clamped at its
both ends. Electrodes are placed on each sides of the nanowire and are used to
actuate the structure (writing, erasing) and to measure the position through a
capactive bridge (reading). The structure is patterned by electron beam
lithography on a pre-stressed thermally grown silicon dioxide layer. When later
released, the stressed material relaxes and the beam buckles in a position of
lower energy. Such symmetric beams, called Euler beams, show two stable
deformed positions thus form a bistable structure. This paper will present the
fabrication, simulation and mechanical and electrical actuation of an in plane
bistable nanowire. Final paper will include a section on FEM simulations.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 09:13:48 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Charlot",
"B.",
"",
"IES"
],
[
"Sun",
"W.",
""
],
[
"Yamashita",
"K.",
""
],
[
"Fujita",
"H.",
""
],
[
"Toshiyoshi",
"H.",
""
]
] |
new_dataset
| 0.999726 |
0805.0892
|
EDA Publishing Association
|
P. Bruschi, M. Dei, M. Piotto
|
Single Chip Sensing of Multiple Gas Flows
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The fabrication and experimental characterization of a thermal flow meter,
capable of detecting and measuring two independent gas flows with a single
chip, is described. The device is based on a 4 x 4 mm2 silicon chip, where a
series of differential micro-anemometers have been integrated together with
standard electronic components by means of postprocessing techniques. The
innovative aspect of the sensor is the use of a plastic adapter, thermally
bonded to the chip, to convey the gas flow only to the areas where the sensors
are located. The use of this inexpensive packaging procedure to include
different sensing structures in distinct flow channels is demonstrated.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 09:16:51 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Bruschi",
"P.",
""
],
[
"Dei",
"M.",
""
],
[
"Piotto",
"M.",
""
]
] |
new_dataset
| 0.987258 |
0805.0903
|
EDA Publishing Association
|
Jhy-Cherng Tsai, Ming-Fong Chen, Hsiharng Yang
|
Design And Fabrication of High Numerical Aperture And Low Aberration
Bi-Convex Micro Lens Array
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Micro lens array is crucial in various kinds of optical and electronic
applications. A micro lens array with high numerical aperture (NA) and low
aberration is in particular needed. This research is aimed to design and
fabricate such a micro lens array with simple structure while keeps the same NA
of a same-diameter hemisphere lens. A bi-convex semispherical micro lens array,
with corresponding NA 0.379, by PDMS is first designed and analyzed.
Experiments are further conducted to fabricate the designed micro lens array by
the thermal reflow process. The formed profile is then sputtered with copper to
serve as the mold. The front and the rear micro lens array are fabricated by
plating PDMS to the mold and then assembled to form the designed micro lens
array.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 09:27:43 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Tsai",
"Jhy-Cherng",
""
],
[
"Chen",
"Ming-Fong",
""
],
[
"Yang",
"Hsiharng",
""
]
] |
new_dataset
| 0.991813 |
0805.0904
|
EDA Publishing Association
|
N. Crespy (IES), J. Courteaud (IES), P. Combette (IES), P. Temple
Boyer (LAAS), A. Giani (IES), A. Foucaran (IES)
|
Micromachined Inclinometer Based on Fluid Convection
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a numerical simulation and experimental results of a
one-dimensional thermal inclinometer with the cavity filled of gas and liquid.
The sensor principle consists of one heating resistor placed between two
detectors. When the resistor is electrically powered, it creates a symmetrical
temperature profile inside a micromachined silicon cavity. By applying a tilt
to the sensor, the profile shifts in the same direction of the sensible axis
corresponding to the horizontal one to one. The temperature profile and the
sensitivity according to the CO2 gas and mineral oil SAE50 have been studied
using numerical resolution of fluid dynamics equations with the computational
fluid dynamics (CFD) software package Fluent V6.2. We have shown that the
sensitivity of liquid sensors is higher than the gas sensors one. By using
micromachined silicon technique, a thermal inclinometer with one pair of
detectors placed at 300 um from the heater has been made. Experimental
measurements corroborate with the numerical simulation.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 09:28:10 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Crespy",
"N.",
"",
"IES"
],
[
"Courteaud",
"J.",
"",
"IES"
],
[
"Combette",
"P.",
"",
"IES"
],
[
"Boyer",
"P. Temple",
"",
"LAAS"
],
[
"Giani",
"A.",
"",
"IES"
],
[
"Foucaran",
"A.",
"",
"IES"
]
] |
new_dataset
| 0.998912 |
0805.0906
|
EDA Publishing Association
|
Doekle Yntema, Joost Van Honschoten, Remco Wiegerink
|
Integrated 3D Sound Intensity Sensor with Four-Wire Particle Velocity
Sensors
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new symmetrical four-wire sensor configuration has resulted in a fully
integrated sound intensity sensor with significant lower noise floor and
smaller size than its predecessors. An integrated sound pressure sensor was
further miniaturized by using a folded "back chamber" at both sides of the
chip.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 09:29:07 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Yntema",
"Doekle",
""
],
[
"Van Honschoten",
"Joost",
""
],
[
"Wiegerink",
"Remco",
""
]
] |
new_dataset
| 0.999545 |
0805.0908
|
EDA Publishing Association
|
Y. Ju, M. Hamada, T. Kobayashi, H. Soyama
|
A Nanostructual Microwave Probe Used for Atomic Force Microscope
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In order to develop a new structure microwave probe, the fabrication of AFM
probe on the GaAs wafer was studied. A waveguide was introduced by evaporating
Au film on the top and bottom surfaces of the GaAs AFM probe. A tip having 8
micrometers high, and curvature radius about 50 nm was formed. The dimensions
of the cantilever are 250x30x15 micrometers. The open structure of the
waveguide at the tip of the probe was introduced by using FIB fabrication. AFM
topography of a grating sample was measured by using the fabricated GaAs
microwave probe. The fabricated probe was found having nanometer scale
resolution, and microwave emission was detected successfully at the tip of the
probe by approaching Cr-V steel and Au wire samples.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 09:30:38 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Ju",
"Y.",
""
],
[
"Hamada",
"M.",
""
],
[
"Kobayashi",
"T.",
""
],
[
"Soyama",
"H.",
""
]
] |
new_dataset
| 0.999017 |
0805.0913
|
EDA Publishing Association
|
Y.-H. Wang, Tzu-Han Hsueh, Rong-Hua Ma, Chia-Yen Lee, Lung-Ming Fu,
P.-Ch. Chou, Chien-Hsiung Tsai
|
A Microcantilever-based Gas Flow Sensor for Flow Rate and Direction
Detection
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The purpose of this paper is to apply characteristics of residual stress that
causes cantilever beams to bend for manufacturing a micro-structured gas flow
sensor. This study uses a silicon wafer deposited silicon nitride layers,
reassembled the gas flow sensor with four cantilever beams that perpendicular
to each other and manufactured piezoresistive structure on each
micro-cantilever by MEMS technologies, respectively. When the cantilever beams
are formed after etching the silicon wafer, it bends up a little due to the
released residual stress induced in the previous fabrication process. As air
flows through the sensor upstream and downstream beam deformation was made,
thus the airflow direction can be determined through comparing the resistance
variation between different cantilever beams. The flow rate can also be
measured by calculating the total resistance variations on the four
cantilevers.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 09:34:02 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Wang",
"Y. -H.",
""
],
[
"Hsueh",
"Tzu-Han",
""
],
[
"Ma",
"Rong-Hua",
""
],
[
"Lee",
"Chia-Yen",
""
],
[
"Fu",
"Lung-Ming",
""
],
[
"Chou",
"P. -Ch.",
""
],
[
"Tsai",
"Chien-Hsiung",
""
]
] |
new_dataset
| 0.967003 |
0805.0930
|
EDA Publishing Association
|
Anis Nordin, Ioana Voiculescu, Mona Zaghloul
|
On-Chip Hotplate for Temperature Control of Cmos Saw Resonators
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Due to the sensitivity of the piezoelectric layer in surface acoustic wave
(SAW) resonators to temperature, a method of achieving device stability as a
function of temperature is required. This work presents the design, modeling
and characterization of integrated dual-serpentine polysilicon resistors as a
method for temperature control of CMOS SAW resonators. The design employs the
oven control temperature stabilization scheme where the device's temperature is
elevated to higher than Tmax to maintain constant device temperature. The
efficiency of the polysilicon resistor as a heating element was verified
through a 1-D partial differential equation model, 3-D CoventorWare finite
element simulations and measurements using Compix thermal camera. To verify
that the on-chip hotplate is effective as a temperature control method, both DC
and RF measurements of the heater together with the resonator were conducted.
Experimental results have indicated that the TCF of the CMOS SAW resonator of
-97.2 ppm/deg C has been reduced to -23.19 ppm/deg C when heated to 56 deg C.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 09:45:09 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Nordin",
"Anis",
""
],
[
"Voiculescu",
"Ioana",
""
],
[
"Zaghloul",
"Mona",
""
]
] |
new_dataset
| 0.999582 |
0805.0932
|
EDA Publishing Association
|
Salim Touati, Nicolas Lorphelin, Alexandre Kanciurzewski, Renaud Robin
(IEMN), A.-S. Rollier, Olivier Millet, Karim Segueni
|
Low Voltage Totally Free Flexible RF MEMS Switch With Anti-Stiction
System
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper concerns a new design of RF MEMS switch combined with an
innovative process which enable low actuation voltage (<5V) and avoid stiction.
First, the structure described with principal design issues, the corresponding
anti-stiction system is presented and FEM simulations are done. Then, a short
description of the process flow based on two non polymer sacrificial layers.
Finally, RF measurements are presented and preliminary experimental protocol
and results of anti-stiction validation is detailed. Resulting RF performances
are -30dB of isolation and -0.45dB of insertion loss at 10 GHz.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 09:46:05 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Touati",
"Salim",
"",
"IEMN"
],
[
"Lorphelin",
"Nicolas",
"",
"IEMN"
],
[
"Kanciurzewski",
"Alexandre",
"",
"IEMN"
],
[
"Robin",
"Renaud",
"",
"IEMN"
],
[
"Rollier",
"A. -S.",
""
],
[
"Millet",
"Olivier",
""
],
[
"Segueni",
"Karim",
""
]
] |
new_dataset
| 0.967536 |
0805.0934
|
EDA Publishing Association
|
Renaud Robin, Salim Touati, Karim Segueni, Olivier Millet, Lionel
Buchaillot (IEMN)
|
A New Four States High Deflection Low Actuation Voltage Electrostatic
Mems Switch for RF Applications
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper presents a new electrostatic MEMS (MicroElectroMechanical System)
based on a single high reliability totally free flexible membrane. Using four
electrodes, this structure enables four states which allowed large deflections
(4$\mu$m) with low actuation voltage (7,5V). This design presents also a good
contact force and improve the restoring force of the structure. As an example
of application, a Single Pole Double Throw (SPDT) for 24GHz applications, based
on this design, has been simulated.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 09:47:09 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Robin",
"Renaud",
"",
"IEMN"
],
[
"Touati",
"Salim",
"",
"IEMN"
],
[
"Segueni",
"Karim",
"",
"IEMN"
],
[
"Millet",
"Olivier",
"",
"IEMN"
],
[
"Buchaillot",
"Lionel",
"",
"IEMN"
]
] |
new_dataset
| 0.990575 |
0805.0935
|
EDA Publishing Association
|
C.-Y. Lee, Zgen-Hui Chen, Hsien-Tseng Chang, Chiang-Ho Cheng,
Chih-Yung Wen
|
Design and Fabrication of a Novel Micro Electromagnetic Actuator
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The present study presents a new micro electromagnetic actuator utilizing a
PDMS membrane with a magnet. The actuator is integrated with micro coils to
electromagnetically actuate the membrane and results in a large deflection. The
micro electromagnetic actuator proposed in this study is easily fabricated and
is readily integrated with existing bio-medical chips due to its planar
structure.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 09:47:38 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Lee",
"C. -Y.",
""
],
[
"Chen",
"Zgen-Hui",
""
],
[
"Chang",
"Hsien-Tseng",
""
],
[
"Cheng",
"Chiang-Ho",
""
],
[
"Wen",
"Chih-Yung",
""
]
] |
new_dataset
| 0.999021 |
0805.0938
|
EDA Publishing Association
|
Patrick Sangouard (ESYCOM-Esiee), G. Lissorgues (ESYCOM-Esiee), T.
Bourouina (ESYCOM-Esiee)
|
A Novel Piezoelectric Microtransformer for Autonmous Sensors
Applications
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This work relates to a novel piezoelectric transformer to be used in an
autonomous sensor unit, possibly in conjunction with a RF-MEMS retro-modulator.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 09:49:38 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Sangouard",
"Patrick",
"",
"ESYCOM-Esiee"
],
[
"Lissorgues",
"G.",
"",
"ESYCOM-Esiee"
],
[
"Bourouina",
"T.",
"",
"ESYCOM-Esiee"
]
] |
new_dataset
| 0.999204 |
0805.0941
|
EDA Publishing Association
|
Andras Vass-Varnai, M. Rencz
|
Package Hermeticity Testing with Thermal Transient Measurements
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The rapid incursion of new technologies such as MEMS and smart sensor device
manufacturing requires new tailor-made packaging designs. In many applications
these devices are exposed to humid environments. Since the penetration of
moisture into the package may result in internal corrosion or shift of the
operating parameters, the reliability testing of hermetically sealed packages
has become a crucial question in the semiconductor industry.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 09:52:00 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Vass-Varnai",
"Andras",
""
],
[
"Rencz",
"M.",
""
]
] |
new_dataset
| 0.988779 |
0805.0942
|
EDA Publishing Association
|
C. Seguineau, M. Ignat (SIMAP), C. Malhaire (INSAT), S. Brida, X.
Lafontan, J.-M. Desmarres, C. Josserond (SIMAP), L. Debove (SIMAP)
|
Micro-tensile tests on micromachined metal on polymer specimens:
elasticity, plasticity and rupture
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This study is focused on the mechanical characterization of materials used in
microelectronic and micro- electromechanical systems (MEMS) devices. In order
to determine their mechanical parameters, a new deformation bench test with
suitable micromachined specimens have been developed. Uniaxial tensile tests
were performed on "low cost" specimens, consisting in electroplated thin copper
films and structures, deposited on a polimide type substrate. Moreover, a
cyclic mechanical actuation via piezoelectric actuators was tested on the same
deformation bench. These experiments validate the device for performing dynamic
characterization of materials, and reliability studies of different
microstructures.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 09:52:18 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Seguineau",
"C.",
"",
"SIMAP"
],
[
"Ignat",
"M.",
"",
"SIMAP"
],
[
"Malhaire",
"C.",
"",
"INSAT"
],
[
"Brida",
"S.",
"",
"SIMAP"
],
[
"Lafontan",
"X.",
"",
"SIMAP"
],
[
"Desmarres",
"J. -M.",
"",
"SIMAP"
],
[
"Josserond",
"C.",
"",
"SIMAP"
],
[
"Debove",
"L.",
"",
"SIMAP"
]
] |
new_dataset
| 0.994142 |
0805.0943
|
EDA Publishing Association
|
K.I. Sinclair, T. Tilford, M.Y.P. Desmulliez, G. Goussetis, C. Bailey,
K. Parrott, A.J. Sangster
|
Open Ended Microwave Oven for Packaging
|
Submitted on behalf of EDA Publishing Association
(http://irevues.inist.fr/handle/2042/16838)
|
Dans Symposium on Design, Test, Integration and Packaging of
MEMS/MOEMS - DTIP 2008, Nice : France (2008)
| null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A novel open waveguide cavity resonator is presented for the combined
variable frequency microwave curing of bumps, underfills and encapsulants, as
well as the alignment of devices for fast flip-chip assembly, direct chip
attach (DCA) or wafer-scale level packaging (WSLP). This technology achieves
radio frequency (RF) curing of adhesives used in microelectronics,
optoelectronics and medical devices with potential simultaneous micron-scale
alignment accuracy and bonding of devices. In principle, the open oven cavity
can be fitted directly onto a flip-chip or wafer scale bonder and, as such,
will allow for the bonding of devices through localised heating thus reducing
the risk to thermally sensitive devices. Variable frequency microwave (VFM)
heating and curing of an idealised polymer load is numerically simulated using
a multi-physics approach. Electro-magnetic fields within a novel open ended
microwave oven developed for use in micro-electronics manufacturing
applications are solved using a de icated Yee scheme finite-difference
time-domain (FDTD) solver. Temperature distribution, degree of cure and thermal
stresses are analysed using an Unstructured Finite Volume method (UFVM)
multi-physics package. The polymer load was meshed for thermophysical analysis,
whilst the microwave cavity - encompassing the polymer load - was meshed for
microwave irradiation. The two solution domains are linked using a
cross-mapping routine. The principle of heating using the evanescent fringing
fields within the open-end of the cavity is demonstrated. A closed loop
feedback routine is established allowing the temperature within a lossy sample
to be controlled. A distribution of the temperature within the lossy sample is
obtained by using a thermal imaging camera.
|
[
{
"version": "v1",
"created": "Wed, 7 May 2008 09:52:26 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Sinclair",
"K. I.",
""
],
[
"Tilford",
"T.",
""
],
[
"Desmulliez",
"M. Y. P.",
""
],
[
"Goussetis",
"G.",
""
],
[
"Bailey",
"C.",
""
],
[
"Parrott",
"K.",
""
],
[
"Sangster",
"A. J.",
""
]
] |
new_dataset
| 0.998297 |
0805.3747
|
Anon Plangprasopchok
|
Anon Plangprasopchok and Kristina Lerman
|
Constructing Folksonomies from User-specified Relations on Flickr
|
14 Pages, Submitted to the Workshop on Web Mining and Web Usage
Analysis (WebKDD 2008)
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many social Web sites allow users to publish content and annotate with
descriptive metadata. In addition to flat tags, some social Web sites have
recently began to allow users to organize their content and metadata
hierarchically. The social photosharing site Flickr, for example, allows users
to group related photos in sets, and related sets in collections. The social
bookmarking site Del.icio.us similarly lets users group related tags into
bundles. Although the sites themselves don't impose any constraints on how
these hierarchies are used, individuals generally use them to capture
relationships between concepts, most commonly the broader/narrower relations.
Collective annotation of content with hierarchical relations may lead to an
emergent classification system, called a folksonomy. While some researchers
have explored using tags as evidence for learning folksonomies, we believe that
hierarchical relations described above offer a high-quality source of evidence
for this task.
We propose a simple approach to aggregate shallow hierarchies created by many
distinct Flickr users into a common folksonomy. Our approach uses statistics to
determine if a particular relation should be retained or discarded. The
relations are then woven together into larger hierarchies. Although we have not
carried out a detailed quantitative evaluation of the approach, it looks very
promising since it generates very reasonable, non-trivial hierarchies.
|
[
{
"version": "v1",
"created": "Sat, 24 May 2008 07:02:24 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Plangprasopchok",
"Anon",
""
],
[
"Lerman",
"Kristina",
""
]
] |
new_dataset
| 0.959595 |
0806.1569
|
Feng Xia
|
Feng Xia, Yu-Chu Tian, Yanjun Li, Youxian Sun
|
Wireless Sensor/Actuator Network Design for Mobile Control Applications
|
17 pages, 8 figures; Open Access at
http://www.mdpi.org/sensors/papers/s7102157.pdf
|
Sensors, vol.7, no.10, pp.2157-2173, 2007
| null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Wireless sensor/actuator networks (WSANs) are emerging as a new generation of
sensor networks. Serving as the backbone of control applications, WSANs will
enable an unprecedented degree of distributed and mobile control. However, the
unreliability of wireless communications and the real-time requirements of
control applications raise great challenges for WSAN design. With emphasis on
the reliability issue, this paper presents an application-level design
methodology for WSANs in mobile control applications. The solution is generic
in that it is independent of the underlying platforms, environment, control
system models, and controller design. To capture the link quality
characteristics in terms of packet loss rate, experiments are conducted on a
real WSAN system. From the experimental observations, a simple yet efficient
method is proposed to deal with unpredictable packet loss on actuator nodes.
Trace-based simulations give promising results, which demonstrate the
effectiveness of the proposed approach.
|
[
{
"version": "v1",
"created": "Tue, 10 Jun 2008 04:20:01 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Xia",
"Feng",
""
],
[
"Tian",
"Yu-Chu",
""
],
[
"Li",
"Yanjun",
""
],
[
"Sun",
"Youxian",
""
]
] |
new_dataset
| 0.998225 |
0806.1711
|
Ian Kash
|
Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern
|
The Lotus-Eater Attack
| null | null | null | null |
cs.NI cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Many protocols for distributed and peer-to-peer systems have the feature that
nodes will stop providing service for others once they have received a certain
amount of service. Examples include BitTorent's unchoking policy, BAR Gossip's
balanced exchanges, and threshold strategies in scrip systems. An attacker can
exploit this by providing service in a targeted way to prevent chosen nodes
from providing service. While such attacks cannot be prevented, we discuss
techniques that can be used to limit the damage they do. These techniques
presume that a certain number of processes will follow the recommended
protocol, even if they could do better by ``gaming'' the system.
|
[
{
"version": "v1",
"created": "Tue, 10 Jun 2008 17:31:42 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Kash",
"Ian A.",
""
],
[
"Friedman",
"Eric J.",
""
],
[
"Halpern",
"Joseph Y.",
""
]
] |
new_dataset
| 0.993571 |
0806.1812
|
Vasiliki Liagkou Dr.
|
V. Liagkou, E. Makri, P. Spirakis and Y.C. Stamatiou
|
A probabilistic key agreement scheme for sensor networks without key
predistribution
|
14 pages, 1 figure
| null | null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The dynamic establishment of shared information (e.g. secret key) between two
entities is particularly important in networks with no pre-determined structure
such as wireless sensor networks (and in general wireless mobile ad-hoc
networks). In such networks, nodes establish and terminate communication
sessions dynamically with other nodes which may have never been encountered
before, in order to somehow exchange information which will enable them to
subsequently communicate in a secure manner. In this paper we give and
theoretically analyze a series of protocols that enables two entities that have
never encountered each other before to establish a shared piece of information
for use as a key in setting up a secure communication session with the aid of a
shared key encryption algorithm. These protocols do not require previous
pre-distribution of candidate keys or some other piece of information of
specialized form except a small seed value, from which the two entities can
produce arbitrarily long strings with many similarities.
|
[
{
"version": "v1",
"created": "Wed, 11 Jun 2008 08:39:04 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Liagkou",
"V.",
""
],
[
"Makri",
"E.",
""
],
[
"Spirakis",
"P.",
""
],
[
"Stamatiou",
"Y. C.",
""
]
] |
new_dataset
| 0.972567 |
0806.2549
|
Adrien Van Den Bossche
|
Adrien Van Den Bossche (LATTIS), Thierry Val (LATTIS), Eric Campo
(LATTIS)
|
Prototyping and Performance Analysis of a QoS MAC Layer for Industrial
Wireless Network
|
7th IFAC International Conference on. Fieldbuses and nETworks in
industrial and embedded systems, Toulouse : France (2007)
| null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Today's industrial sensor networks require strong reliability and guarantees
on messages delivery. These needs are even more important in real time
applications like control/command, such as robotic wireless communications
where strong temporal constraints are critical. For these reasons, classical
random-based Medium Access Control (MAC) protocols present a non-null frame
collision probability. In this paper we present an original full deterministic
MAC-layer for industrial wireless network and its performance evaluation thanks
to the development of a material prototype.
|
[
{
"version": "v1",
"created": "Mon, 16 Jun 2008 11:40:57 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Bossche",
"Adrien Van Den",
"",
"LATTIS"
],
[
"Val",
"Thierry",
"",
"LATTIS"
],
[
"Campo",
"Eric",
"",
"LATTIS"
]
] |
new_dataset
| 0.983451 |
0806.2726
|
Matthias Hesse
|
Matthias Hesse (I3S), Jerome Lebrun (I3S), Luc Deneire (I3S)
|
L2 Orthogonal Space Time Code for Continuous Phase Modulation
| null |
Dans 9th IEEE International Workshop on Signal Processing Advances
in Wireless Communications (2008)
| null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
To combine the high power efficiency of Continuous Phase Modulation (CPM)
with either high spectral efficiency or enhanced performance in low Signal to
Noise conditions, some authors have proposed to introduce CPM in a MIMO frame,
by using Space Time Codes (STC). In this paper, we address the code design
problem of Space Time Block Codes combined with CPM and introduce a new design
criterion based on L2 orthogonality. This L2 orthogonality condition, with the
help of simplifying assumption, leads, in the 2x2 case, to a new family of
codes. These codes generalize the Wang and Xia code, which was based on
pointwise orthogonality. Simulations indicate that the new codes achieve full
diversity and a slightly better coding gain. Moreover, one of the codes can be
interpreted as two antennas fed by two conventional CPMs using the same data
but with different alphabet sets. Inspection of these alphabet sets lead also
to a simple explanation of the (small) spectrum broadening of Space Time Coded
CPM.
|
[
{
"version": "v1",
"created": "Tue, 17 Jun 2008 08:59:18 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Hesse",
"Matthias",
"",
"I3S"
],
[
"Lebrun",
"Jerome",
"",
"I3S"
],
[
"Deneire",
"Luc",
"",
"I3S"
]
] |
new_dataset
| 0.998163 |
0806.2760
|
Matthias Hesse
|
Matthias Hesse (I3S), Jerome Lebrun (I3S), Luc Deneire (I3S)
|
L2 OSTC-CPM: Theory and design
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The combination of space-time coding (STC) and continuous phase modulation
(CPM) is an attractive field of research because both STC and CPM bring many
advantages for wireless communications. Zhang and Fitz [1] were the first to
apply this idea by constructing a trellis based scheme. But for these codes the
decoding effort grows exponentially with the number of transmitting antennas.
This was circumvented by orthogonal codes introduced by Wang and Xia [2].
Unfortunately, based on Alamouti code [3], this design is restricted to two
antennas. However, by relaxing the orthogonality condition, we prove here that
it is possible to design L2-orthogonal space-time codes which achieve full rate
and full diversity with low decoding effort. In part one, we generalize the
two-antenna code proposed by Wang and Xia [2] from pointwise to
L2-orthogonality and in part two we present the first L2-orthogonal code for
CPM with three antennas. In this report, we detail these results and focus on
the properties of these codes. Of special interest is the optimization of the
bit error rate which depends on the initial phase of the system. Our simulation
results illustrate the systemic behavior of these conditions.
|
[
{
"version": "v1",
"created": "Tue, 17 Jun 2008 11:43:17 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Hesse",
"Matthias",
"",
"I3S"
],
[
"Lebrun",
"Jerome",
"",
"I3S"
],
[
"Deneire",
"Luc",
"",
"I3S"
]
] |
new_dataset
| 0.99063 |
0806.3456
|
Hans Raj Tiwary
|
Khaled Elbassioni and Hans Raj Tiwary
|
On Computing the Vertex Centroid of a Polyhedron
| null | null | null | null |
cs.CG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Let $\mathcal{P}$ be an $\mathcal{H}$-polytope in $\mathbb{R}^d$ with vertex
set $V$. The vertex centroid is defined as the average of the vertices in $V$.
We prove that computing the vertex centroid of an $\mathcal{H}$-polytope is
#P-hard. Moreover, we show that even just checking whether the vertex centroid
lies in a given halfspace is already #P-hard for $\mathcal{H}$-polytopes. We
also consider the problem of approximating the vertex centroid by finding a
point within an $\epsilon$ distance from it and prove this problem to be
#P-easy by showing that given an oracle for counting the number of vertices of
an $\mathcal{H}$-polytope, one can approximate the vertex centroid in
polynomial time. We also show that any algorithm approximating the vertex
centroid to \emph{any} ``sufficiently'' non-trivial (for example constant)
distance, can be used to construct a fully polynomial approximation scheme for
approximating the centroid and also an output-sensitive polynomial algorithm
for the Vertex Enumeration problem. Finally, we show that for unbounded
polyhedra the vertex centroid can not be approximated to a distance of
$d^{{1/2}-\delta}$ for any fixed constant $\delta>0$.
|
[
{
"version": "v1",
"created": "Fri, 20 Jun 2008 20:56:19 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Elbassioni",
"Khaled",
""
],
[
"Tiwary",
"Hans Raj",
""
]
] |
new_dataset
| 0.998681 |
0806.3708
|
Jocelyne Troccaz
|
S\'ebastien Martin (TIMC), Vincent Daanen (TIMC), Jocelyne Troccaz
(TIMC)
|
Atlas-Based Prostate Segmentation Using an Hybrid Registration
|
International Journal of Computer Assisted Radiology and Surgery
(2008) 000-999
| null | null | null |
cs.OH
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Purpose: This paper presents the preliminary results of a semi-automatic
method for prostate segmentation of Magnetic Resonance Images (MRI) which aims
to be incorporated in a navigation system for prostate brachytherapy. Methods:
The method is based on the registration of an anatomical atlas computed from a
population of 18 MRI exams onto a patient image. An hybrid registration
framework which couples an intensity-based registration with a robust
point-matching algorithm is used for both atlas building and atlas
registration. Results: The method has been validated on the same dataset that
the one used to construct the atlas using the "leave-one-out method". Results
gives a mean error of 3.39 mm and a standard deviation of 1.95 mm with respect
to expert segmentations. Conclusions: We think that this segmentation tool may
be a very valuable help to the clinician for routine quantitative image
exploitation.
|
[
{
"version": "v1",
"created": "Mon, 23 Jun 2008 15:43:28 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Martin",
"Sébastien",
"",
"TIMC"
],
[
"Daanen",
"Vincent",
"",
"TIMC"
],
[
"Troccaz",
"Jocelyne",
"",
"TIMC"
]
] |
new_dataset
| 0.957821 |
0806.4372
|
Stavros Nikolopoulos D.
|
Katerina Asdre and Stavros D. Nikolopoulos
|
The 1-fixed-endpoint Path Cover Problem is Polynomial on Interval Graph
| null | null | null | null |
cs.DS cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We consider a variant of the path cover problem, namely, the
$k$-fixed-endpoint path cover problem, or kPC for short, on interval graphs.
Given a graph $G$ and a subset $\mathcal{T}$ of $k$ vertices of $V(G)$, a
$k$-fixed-endpoint path cover of $G$ with respect to $\mathcal{T}$ is a set of
vertex-disjoint paths $\mathcal{P}$ that covers the vertices of $G$ such that
the $k$ vertices of $\mathcal{T}$ are all endpoints of the paths in
$\mathcal{P}$. The kPC problem is to find a $k$-fixed-endpoint path cover of
$G$ of minimum cardinality; note that, if $\mathcal{T}$ is empty the stated
problem coincides with the classical path cover problem. In this paper, we
study the 1-fixed-endpoint path cover problem on interval graphs, or 1PC for
short, generalizing the 1HP problem which has been proved to be NP-complete
even for small classes of graphs. Motivated by a work of Damaschke, where he
left both 1HP and 2HP problems open for the class of interval graphs, we show
that the 1PC problem can be solved in polynomial time on the class of interval
graphs. The proposed algorithm is simple, runs in $O(n^2)$ time, requires
linear space, and also enables us to solve the 1HP problem on interval graphs
within the same time and space complexity.
|
[
{
"version": "v1",
"created": "Thu, 26 Jun 2008 18:13:31 GMT"
}
] | 2008-12-18T00:00:00 |
[
[
"Asdre",
"Katerina",
""
],
[
"Nikolopoulos",
"Stavros D.",
""
]
] |
new_dataset
| 0.99696 |
0812.2990
|
Frederic Mazoit
|
Fr\'ed\'eric Mazoit (LaBRI)
|
Tree-width of hypergraphs and surface duality
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In Graph Minor III, Robertson and Seymour conjecture that the tree-width of a
planar graph and that of its dual differ by at most one. We prove that given a
hypergraph H on a surface of Euler genus k, the tree-width of H^* is at most
the maximum of tw(H) + 1 + k and the maximum size of a hyperedge of H^*.
|
[
{
"version": "v1",
"created": "Tue, 16 Dec 2008 07:47:50 GMT"
}
] | 2008-12-17T00:00:00 |
[
[
"Mazoit",
"Frédéric",
"",
"LaBRI"
]
] |
new_dataset
| 0.999112 |
0812.2313
|
Jocelyne Troccaz
|
Pierre Mozer (TIMC, URObotics), Jocelyne Troccaz (TIMC), Dan
Stoianovici (URObotics)
|
Urologic robots and future directions
| null |
Current Opinion in Urology 19, 1 (2009) 114-9
|
10.1097/MOU.0b013e32831cc1ba
| null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
PURPOSE OF REVIEW: Robot-assisted laparoscopic surgery in urology has gained
immense popularity with the daVinci system, but a lot of research teams are
working on new robots. The purpose of this study is to review current urologic
robots and present future development directions. RECENT FINDINGS: Future
systems are expected to advance in two directions: improvements of remote
manipulation robots and developments of image-guided robots. SUMMARY: The final
goal of robots is to allow safer and more homogeneous outcomes with less
variability of surgeon performance, as well as new tools to perform tasks on
the basis of medical transcutaneous imaging, in a less invasive way, at lower
costs. It is expected that improvements for a remote system could be augmented
in reality, with haptic feedback, size reduction, and development of new tools
for natural orifice translumenal endoscopic surgery. The paradigm of
image-guided robots is close to clinical availability and the most advanced
robots are presented with end-user technical assessments. It is also notable
that the potential of robots lies much further ahead than the accomplishments
of the daVinci system. The integration of imaging with robotics holds a
substantial promise, because this can accomplish tasks otherwise impossible.
Image-guided robots have the potential to offer a paradigm shift.
|
[
{
"version": "v1",
"created": "Fri, 12 Dec 2008 08:38:23 GMT"
}
] | 2008-12-15T00:00:00 |
[
[
"Mozer",
"Pierre",
"",
"TIMC, URObotics"
],
[
"Troccaz",
"Jocelyne",
"",
"TIMC"
],
[
"Stoianovici",
"Dan",
"",
"URObotics"
]
] |
new_dataset
| 0.984449 |
0812.1951
|
Jerome Leroux
|
Alain Finkel (LSV), J\'er\^ome Leroux (LaBRI)
|
The convex hull of a regular set of integer vectors is polyhedral and
effectively computable
| null |
Information Processing Letters 96, 1 (2005) 30 - 35
|
10.1016/j.ipl.2005.04.004
| null |
cs.CG cs.DS cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Number Decision Diagrams (NDD) provide a natural finite symbolic
representation for regular set of integer vectors encoded as strings of digit
vectors (least or most significant digit first). The convex hull of the set of
vectors represented by a NDD is proved to be an effectively computable convex
polyhedron.
|
[
{
"version": "v1",
"created": "Wed, 10 Dec 2008 16:26:36 GMT"
}
] | 2008-12-13T00:00:00 |
[
[
"Finkel",
"Alain",
"",
"LSV"
],
[
"Leroux",
"Jérôme",
"",
"LaBRI"
]
] |
new_dataset
| 0.9873 |
0812.2014
|
Jerome Leroux
|
J\'er\^ome Leroux (LaBRI)
|
Convex Hull of Arithmetic Automata
| null |
Static Analysis, Valencia : Espagne (2008)
|
10.1007/978-3-540-69166-2_4
| null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Arithmetic automata recognize infinite words of digits denoting
decompositions of real and integer vectors. These automata are known expressive
and efficient enough to represent the whole set of solutions of complex linear
constraints combining both integral and real variables. In this paper, the
closed convex hull of arithmetic automata is proved rational polyhedral.
Moreover an algorithm computing the linear constraints defining these convex
set is provided. Such an algorithm is useful for effectively extracting
geometrical properties of the whole set of solutions of complex constraints
symbolically represented by arithmetic automata.
|
[
{
"version": "v1",
"created": "Wed, 10 Dec 2008 20:33:27 GMT"
}
] | 2008-12-11T00:00:00 |
[
[
"Leroux",
"Jérôme",
"",
"LaBRI"
]
] |
new_dataset
| 0.996434 |
0808.3453
|
Gilles Z\'emor
|
Alexander Barg and Arya Mazumdar and Gilles Z\'emor
|
Codes on hypergraphs
|
16 pages
|
Advances in Mathematics of Communications (AMC), Vol. 2, No 4,
(2008) pp. 433 - 450.
|
10.3934/amc.2008.2.433
| null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Codes on hypergraphs are an extension of the well-studied family of codes on
bipartite graphs. Bilu and Hoory (2004) constructed an explicit family of codes
on regular t-partite hypergraphs whose minimum distance improves earlier
estimates of the distance of bipartite-graph codes. They also suggested a
decoding algorithm for such codes and estimated its error-correcting
capability.
In this paper we study two aspects of hypergraph codes. First, we compute the
weight enumerators of several ensembles of such codes, establishing conditions
under which they attain the Gilbert-Varshamov bound and deriving estimates of
their distance. In particular, we show that this bound is attained by codes
constructed on a fixed bipartite graph with a large spectral gap.
We also suggest a new decoding algorithm of hypergraph codes that corrects a
constant fraction of errors, improving upon the algorithm of Bilu and Hoory.
|
[
{
"version": "v1",
"created": "Tue, 26 Aug 2008 08:30:14 GMT"
},
{
"version": "v2",
"created": "Sat, 30 Aug 2008 08:53:08 GMT"
}
] | 2008-12-10T00:00:00 |
[
[
"Barg",
"Alexander",
""
],
[
"Mazumdar",
"Arya",
""
],
[
"Zémor",
"Gilles",
""
]
] |
new_dataset
| 0.99977 |
0808.3712
|
Michel Fliess
|
Michel Fliess (LIX, INRIA Saclay - Ile de France)
|
Critique du rapport signal \`a bruit en communications num\'eriques --
Questioning the signal to noise ratio in digital communications
| null |
ARIMA (Revue africaine d'informatique et de Math\'ematiques
appliqu\'ees) 9 (2008) 419-429
| null | null |
cs.IT math.IT math.PR math.RA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The signal to noise ratio, which plays such an important r\^ole in
information theory, is shown to become pointless for digital communications
where the demodulation is achieved via new fast estimation techniques.
Operational calculus, differential algebra, noncommutative algebra and
nonstandard analysis are the main mathematical tools.
|
[
{
"version": "v1",
"created": "Wed, 27 Aug 2008 14:05:38 GMT"
},
{
"version": "v2",
"created": "Thu, 4 Dec 2008 15:04:53 GMT"
},
{
"version": "v3",
"created": "Wed, 10 Dec 2008 10:39:01 GMT"
}
] | 2008-12-10T00:00:00 |
[
[
"Fliess",
"Michel",
"",
"LIX, INRIA Saclay - Ile de France"
]
] |
new_dataset
| 0.989996 |
0801.4230
|
Simon Perdrix
|
Simon Perdrix
|
Quantum entanglement analysis based on abstract interpretation
|
13 pages
|
Proc. of 15th International Static Analysis Symposium (SAS 2008).
LNCS 5079, pp 270-282
|
10.1007/978-3-540-69166-2_18
| null |
cs.LO cs.PL quant-ph
| null |
Entanglement is a non local property of quantum states which has no classical
counterpart and plays a decisive role in quantum information theory. Several
protocols, like the teleportation, are based on quantum entangled states.
Moreover, any quantum algorithm which does not create entanglement can be
efficiently simulated on a classical computer. The exact role of the
entanglement is nevertheless not well understood. Since an exact analysis of
entanglement evolution induces an exponential slowdown, we consider
approximative analysis based on the framework of abstract interpretation. In
this paper, a concrete quantum semantics based on superoperators is associated
with a simple quantum programming language. The representation of entanglement,
i.e. the design of the abstract domain is a key issue. A representation of
entanglement as a partition of the memory is chosen. An abstract semantics is
introduced, and the soundness of the approximation is proven.
|
[
{
"version": "v1",
"created": "Mon, 28 Jan 2008 10:45:47 GMT"
}
] | 2008-12-08T00:00:00 |
[
[
"Perdrix",
"Simon",
""
]
] |
new_dataset
| 0.996689 |
0812.0706
|
Soubhik Chakraborty
|
Soubhik Chakraborty, Rayalla Ranganayakulu, Shivee Chauhan, Sandeep
Singh Solanki and Kartik Mahto
|
Which notes are Vadi-Samvadi in Raga Rageshree?
|
20 pages;04 figures
| null | null | null |
cs.SD
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The notes which play the most important and second most important roles in
expressing a raga are called Vadi and Samvadi swars respectively in (North)
Indian Classical music. Like Bageshree, Bhairavi, Shankara, Hamir and Kalingra,
Rageshree is another controversial raga so far as the choice of Vadi-Samvadi
selection is concerned where there are two different opinions. In the present
work, a two minute vocal recording of raga Rageshree is subjected to a careful
statistical analysis. Our analysis is broken into three phases: first half,
middle half and last half. Under a multinomial model set up holding appreciably
in the first two phases, only one opinion is found acceptable. In the last
phase the distribution seems to be quasi multinomial, characterized by an
unstable nature of relative occurrence of pitch of all the notes and although
the note whose relative occurrence of pitch suddenly shoots is the Vadi swar
selected from our analysis of the first two phases, we take it as an outlier
demanding a separate treatment like any other in statistics. Selection of
Vadi-Samvadi notes in a quasi-multinomial set up is still an open research
problem. An interesting musical cocktail is proposed, however, embedding
several ideas like melodic property of notes, note combinations and pitch
movements between notes, using some weighted combination of psychological and
statistical stability of notes along with watching carefully the sudden shoot
of one or more notes whenever there is enough evidence that multinomial model
has broken down.
|
[
{
"version": "v1",
"created": "Wed, 3 Dec 2008 12:47:08 GMT"
}
] | 2008-12-04T00:00:00 |
[
[
"Chakraborty",
"Soubhik",
""
],
[
"Ranganayakulu",
"Rayalla",
""
],
[
"Chauhan",
"Shivee",
""
],
[
"Solanki",
"Sandeep Singh",
""
],
[
"Mahto",
"Kartik",
""
]
] |
new_dataset
| 0.999114 |
0812.0759
|
Gaurav Bhatnagar Mr.
|
R. Balasubramanian, Gaurav Bhatnagar
|
A new Contrast Based Image Fusion using Wavelet Packets
|
5 Pages, 10 Figures, 1 Table
|
Proc. of IEEE Conference on Applications of Intelligent Systems
(AIS 2008), March 13-15, 2008, Sonepat, India, pp. 141-145.
(ISBN:978-81-906531-0-7)
| null | null |
cs.IT cs.MM math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Image Fusion, a technique which combines complimentary information from
different images of the same scene so that the fused image is more suitable for
segmentation, feature extraction, object recognition and Human Visual System.
In this paper, a simple yet efficient algorithm is presented based on contrast
using wavelet packet decomposition. First, all the source images are decomposed
into low and high frequency sub-bands and then fusion of high frequency
sub-bands is done by the means of Directive Contrast. Now, inverse wavelet
packet transform is performed to reconstruct the fused image. The performance
of the algorithm is carried out by the comparison made between proposed and
existing algorithm.
|
[
{
"version": "v1",
"created": "Wed, 3 Dec 2008 17:29:19 GMT"
}
] | 2008-12-04T00:00:00 |
[
[
"Balasubramanian",
"R.",
""
],
[
"Bhatnagar",
"Gaurav",
""
]
] |
new_dataset
| 0.975423 |
0811.4681
|
Ga?tan Le Guelvouit
|
Ga\"etan Le Guelvouit, Teddy Furon, Fran\c{c}ois Cayre
|
The Good, the Bad, and the Ugly: three different approaches to break
their watermarking system
|
8 pages, 8 figures
|
Proc. IS&T/SPIE Electronic Imaging, vol. 6505, San Jose, CA, Jan.
2007
|
10.1117/12.703968
| null |
cs.GR cs.MM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Good is Blondie, a wandering gunman with a strong personal sense of
honor. The Bad is Angel Eyes, a sadistic hitman who always hits his mark. The
Ugly is Tuco, a Mexican bandit who's always only looking out for himself.
Against the backdrop of the BOWS contest, they search for a watermark in gold
buried in three images. Each knows only a portion of the gold's exact location,
so for the moment they're dependent on each other. However, none are
particularly inclined to share...
|
[
{
"version": "v1",
"created": "Fri, 28 Nov 2008 16:31:12 GMT"
}
] | 2008-12-01T00:00:00 |
[
[
"Guelvouit",
"Gaëtan Le",
""
],
[
"Furon",
"Teddy",
""
],
[
"Cayre",
"François",
""
]
] |
new_dataset
| 0.996582 |
0708.3019
|
Ananthanarayanan Chockalingam
|
D. Sreedhar, A. Chockalingam, B. Sundar Rajan
|
Single-Symbol ML Decodable Distributed STBCs for Partially-Coherent
Cooperative Networks
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Space-time block codes (STBCs) that are single-symbol decodable (SSD) in a
co-located multiple antenna setting need not be SSD in a distributed
cooperative communication setting. A relay network with N relays and a single
source-destination pair is called a partially-coherent relay channel (PCRC) if
the destination has perfect channel state information (CSI) of all the channels
and the relays have only the phase information of the source-to-relay channels.
In this paper, first, a new set of necessary and sufficient conditions for a
STBC to be SSD for co-located multiple antenna communication is obtained. Then,
this is extended to a set of necessary and sufficient conditions for a
distributed STBC (DSTBC) to be SSD for a PCRC, by identifying the additional
conditions. Using this, several SSD DSTBCs for PCRC are identified among the
known classes of STBCs. It is proved that even if a SSD STBC for a co-located
MIMO channel does not satisfy the additional conditions for the code to be SSD
for a PCRC, single-symbol decoding of it in a PCRC gives full-diversity and
only coding gain is lost. It is shown that when a DSTBC is SSD for a PCRC, then
arbitrary coordinate interleaving of the in-phase and quadrature-phase
components of the variables does not disturb its SSD property for PCRC.
Finally, it is shown that the possibility of {\em channel phase compensation}
operation at the relay nodes using partial CSI at the relays increases the
possible rate of SSD DSTBCs from $\frac{2}{N}$ when the relays do not have CSI
to 1/2, which is independent of N.
|
[
{
"version": "v1",
"created": "Wed, 22 Aug 2007 13:58:36 GMT"
},
{
"version": "v2",
"created": "Sat, 29 Nov 2008 04:34:11 GMT"
}
] | 2008-11-29T00:00:00 |
[
[
"Sreedhar",
"D.",
""
],
[
"Chockalingam",
"A.",
""
],
[
"Rajan",
"B. Sundar",
""
]
] |
new_dataset
| 0.993657 |
0811.4061
|
Valery Pipin
|
Valery V. Pipin
|
Benchmarking the solar dynamo with Maxima
|
8 pages, 1 figure
| null | null | null |
cs.SE cs.SC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, Jouve et al(A&A, 2008) published the paper that presents the
numerical benchmark for the solar dynamo models. Here, I would like to show a
way how to get it with help of computer algebra system Maxima. This way was
used in our paper (Pipin & Seehafer, A&A 2008, in print) to test some new ideas
in the large-scale stellar dynamos. In the present paper I complement the
dynamo benchmark with the standard test that address the problem of the
free-decay modes in the sphere which is submerged in vacuum.
|
[
{
"version": "v1",
"created": "Tue, 25 Nov 2008 11:35:35 GMT"
},
{
"version": "v2",
"created": "Wed, 26 Nov 2008 04:13:36 GMT"
}
] | 2008-11-26T00:00:00 |
[
[
"Pipin",
"Valery V.",
""
]
] |
new_dataset
| 0.998923 |
0811.4121
|
Sarad AV
|
Sankar K and Sarad AV
|
String Art: Circle Drawing Using Straight Lines
|
12 pages, code included
| null | null | null |
cs.GR cs.OH
|
http://creativecommons.org/licenses/by-nc-sa/3.0/
|
An algorithm to generate the locus of a circle using the intersection points
of straight lines is proposed. The pixels on the circle are plotted independent
of one another and the operations involved in finding the locus of the circle
from the intersection of straight lines are parallelizable. Integer only
arithmetic and algorithmic optimizations are used for speedup. The proposed
algorithm makes use of an envelope to form a parabolic arc which is consequent
transformed into a circle. The use of parabolic arcs for the transformation
results in higher pixel errors as the radius of the circle to be drawn
increases. At its current state, the algorithm presented may be suitable only
for generating circles for string art.
|
[
{
"version": "v1",
"created": "Tue, 25 Nov 2008 17:12:22 GMT"
}
] | 2008-11-26T00:00:00 |
[
[
"K",
"Sankar",
""
],
[
"AV",
"Sarad",
""
]
] |
new_dataset
| 0.996418 |
cs/0111006
|
Robert Soliday
|
Robert Soliday (APS/ANL)
|
Proliferation of SDDS Support for Various Platforms and Languages
|
3 pages, 2 figures, submitted to ICALEPCS 2001
|
eConfC011127:THAP031,2001
| null |
THAP031
|
cs.DB
| null |
Since Self-Describing Data Sets (SDDS) were first introduced, the source code
has been ported to many different operating systems and various languages. SDDS
is now available in C, Tcl, Java, Fortran, and Python. All of these versions
are supported on Solaris, Linux, and Windows. The C version of SDDS is also
supported on VxWorks. With the recent addition of the Java port, SDDS can now
be deployed on virtually any operating system. Due to this proliferation, SDDS
files serve to link not only a collection of C programs, but programs and
scripts in many languages on different operating systems. The platform
independent binary feature of SDDS also facilitates portability among operating
systems. This paper presents an overview of various benefits of SDDS platform
interoperability.
|
[
{
"version": "v1",
"created": "Mon, 5 Nov 2001 18:14:16 GMT"
}
] | 2008-11-26T00:00:00 |
[
[
"Soliday",
"Robert",
"",
"APS/ANL"
]
] |
new_dataset
| 0.999136 |
cs/0111008
|
Xiaojiang Yu
|
X.J. Yu, Q. P. Wang, P.S. Xu
|
The Control of a Beamline Over Intranet
|
Poster at 8th International Conference on Accelerator and Large
experimental Physics Control Systems, San Jose, California, USA, November
2001, 3 pages, pdf, 1 jpeg figure
|
eConfC011127:THAP021,2001
| null | null |
cs.NI
| null |
The machines and beamlines controlled by VME industrial networks are very
popular in accelerator faculties. Recently new software technology, among of
which are Internet/Intranet application, Java language, and distributed
calculating environment, changes the control manner rapidly. A program based on
DCOM is composed to control of a variable included angle spherical grating
monochromator beamline at National Synchrotron Radiation Laboratory (NSRL) in
China. The control computer with a residential DCOM program is connected to
Intranet by LAN, over which the user-end-operating program located in another
computer sends driving beamline units' commands to the control computer. And
also a web page coded in Java, published by the WWW service running in the
control computer, is simply illustrated how to use web browser to query the
states of or to control the beamline units.
|
[
{
"version": "v1",
"created": "Tue, 6 Nov 2001 10:49:54 GMT"
}
] | 2008-11-26T00:00:00 |
[
[
"Yu",
"X. J.",
""
],
[
"Wang",
"Q. P.",
""
],
[
"Xu",
"P. S.",
""
]
] |
new_dataset
| 0.999607 |
cs/0304043
|
S. weinzierl
|
Stefan Weinzierl
|
gTybalt - a free computer algebra system
|
22 pages, 7 figures
|
Comput.Phys.Commun.156:180-198,2004
|
10.1016/S0010-4655(03)00468-5
| null |
cs.SC hep-ph
| null |
This article documents the free computer algebra system "gTybalt". The
program is build on top of other packages, among others GiNaC, TeXmacs and
Root. It offers the possibility of interactive symbolic calculations within the
C++ programming language. Mathematical formulae are visualized using TeX fonts.
|
[
{
"version": "v1",
"created": "Tue, 29 Apr 2003 18:22:47 GMT"
}
] | 2008-11-26T00:00:00 |
[
[
"Weinzierl",
"Stefan",
""
]
] |
new_dataset
| 0.999725 |
cs/0305062
|
Umer Farooq Khalid
|
Aamir Shafi, Umer Farooq, Saad Kiani, Maria Riaz, Anjum Shehzad,
Arshad Ali, Iosif Legrand, Harvey Newman
|
DIAMOnDS - DIstributed Agents for MObile & Dynamic Services
|
7 pages, 4 figures, CHEP03, La Jolla, California, March 24-28, 2003
|
ECONFC0303241:THAT003,2003
| null | null |
cs.DC
| null |
Distributed Services Architecture with support for mobile agents between
services, offer significantly improved communication and computational
flexibility. The uses of agents allow execution of complex operations that
involve large amounts of data to be processed effectively using distributed
resources. The prototype system Distributed Agents for Mobile and Dynamic
Services (DIAMOnDS), allows a service to send agents on its behalf, to other
services, to perform data manipulation and processing. Agents have been
implemented as mobile services that are discovered using the Jini Lookup
mechanism and used by other services for task management and communication.
Agents provide proxies for interaction with other services as well as specific
GUI to monitor and control the agent activity. Thus agents acting on behalf of
one service cooperate with other services to carry out a job, providing
inter-operation of loosely coupled services in a semi-autonomous way. Remote
file system access functionality has been incorporated by the agent framework
and allows services to dynamically share and browse the file system resources
of hosts, running the services. Generic database access functionality has been
implemented in the mobile agent framework that allows performing complex data
mining and processing operations efficiently in distributed system. A basic
data searching agent is also implemented that performs a query based search in
a file system. The testing of the framework was carried out on WAN by moving
Connectivity Test agents between AgentStations in CERN, Switzerland and NUST,
Pakistan.
|
[
{
"version": "v1",
"created": "Fri, 30 May 2003 11:48:57 GMT"
},
{
"version": "v2",
"created": "Fri, 13 Jun 2003 11:56:46 GMT"
}
] | 2008-11-26T00:00:00 |
[
[
"Shafi",
"Aamir",
""
],
[
"Farooq",
"Umer",
""
],
[
"Kiani",
"Saad",
""
],
[
"Riaz",
"Maria",
""
],
[
"Shehzad",
"Anjum",
""
],
[
"Ali",
"Arshad",
""
],
[
"Legrand",
"Iosif",
""
],
[
"Newman",
"Harvey",
""
]
] |
new_dataset
| 0.998785 |
cs/0306009
|
Dimitri Bourilkov
|
A. Arbree, P. Avery, D. Bourilkov, R. Cavanaugh, G. Graham, S.
Katageri, J. Rodriguez, J. Voeckler, M. Wilde
|
Virtual Data in CMS Production
|
Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 5 pages, PDF. PSN TUAT011
|
ECONFC0303241:TUAT011,2003
| null | null |
cs.DC hep-ex
| null |
Initial applications of the GriPhyN Chimera Virtual Data System have been
performed within the context of CMS Production of Monte Carlo Simulated Data.
The GriPhyN Chimera system consists of four primary components: 1) a Virtual
Data Language, which is used to describe virtual data products, 2) a Virtual
Data Catalog, which is used to store virtual data entries, 3) an Abstract
Planner, which resolves all dependencies of a particular virtual data product
and forms a location and existence independent plan, 4) a Concrete Planner,
which maps an abstract, logical plan onto concrete, physical grid resources
accounting for staging in/out files and publishing results to a replica
location service. A CMS Workflow Planner, MCRunJob, is used to generate virtual
data products using the Virtual Data Language. Subsequently, a prototype
workflow manager, known as WorkRunner, is used to schedule the instantiation of
virtual data products across a grid.
|
[
{
"version": "v1",
"created": "Sat, 31 May 2003 21:07:57 GMT"
}
] | 2008-11-26T00:00:00 |
[
[
"Arbree",
"A.",
""
],
[
"Avery",
"P.",
""
],
[
"Bourilkov",
"D.",
""
],
[
"Cavanaugh",
"R.",
""
],
[
"Graham",
"G.",
""
],
[
"Katageri",
"S.",
""
],
[
"Rodriguez",
"J.",
""
],
[
"Voeckler",
"J.",
""
],
[
"Wilde",
"M.",
""
]
] |
new_dataset
| 0.999087 |
cs/0306012
|
Julius Hrivnac
|
Julius Hrivnac
|
GraXML - Modular Geometric Modeler
|
Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003. PSN THJT009
|
ECONFC0303241:THJT009,2003
| null | null |
cs.GR
| null |
Many entities managed by HEP Software Frameworks represent spatial
(3-dimensional) real objects. Effective definition, manipulation and
visualization of such objects is an indispensable functionality.
GraXML is a modular Geometric Modeling toolkit capable of processing
geometric data of various kinds (detector geometry, event geometry) from
different sources and delivering them in ways suitable for further use.
Geometric data are first modeled in one of the Generic Models. Those Models are
then used to populate powerful Geometric Model based on the Java3D technology.
While Java3D has been originally created just to provide visualization of 3D
objects, its light weight and high functionality allow an effective reuse as a
general geometric component. This is possible also thanks to a large overlap
between graphical and general geometric functionality and modular design of
Java3D itself. Its graphical functionalities also allow a natural visualization
of all manipulated elements.
All these techniques have been developed primarily (or only) for the Java
environment. It is, however, possible to interface them transparently to
Frameworks built in other languages, like for example C++.
The GraXML toolkit has been tested with data from several sources, as for
example ATLAS and ALICE detector description and ATLAS event data. Prototypes
for other sources, like Geometry Description Markup Language (GDML) exist too
and interface to any other source is easy to add.
|
[
{
"version": "v1",
"created": "Mon, 2 Jun 2003 09:04:18 GMT"
}
] | 2008-11-26T00:00:00 |
[
[
"Hrivnac",
"Julius",
""
]
] |
new_dataset
| 0.995257 |
cs/0306024
|
Alwin Brokmann
|
Alwin Brokmann
|
Monitoring Systems and Services
|
Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 3 pages pdf,PSN THET03
|
ECONFC0303241:THET003,2003
| null | null |
cs.OH
| null |
The DESY Computer Center is the home of O(1000) computers supplying a wide
range of different services Monitoring such a large installation is a
challenge. After a long time running a SNMP based commercial Network Management
System, the evaluation of a new System was started. There are a lot of
different commercial and freeware products on the market, but none of them
fully satisfied all our requirements. After re-valuating our original
requirements we selected NAGIOS as our monitoring and alarming tool. After a
successful test we are in production since autumn 2002 and are extending the
service to fully support a distributed monitoring and alarming.
|
[
{
"version": "v1",
"created": "Thu, 5 Jun 2003 10:07:19 GMT"
}
] | 2008-11-26T00:00:00 |
[
[
"Brokmann",
"Alwin",
""
]
] |
new_dataset
| 0.95467 |
cs/0306030
|
Andrew McNab
|
A. McNab
|
Grid-based access control for Unix environments, Filesystems and Web
Sites
|
Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 3 pages, LaTex. PSN TUBT008
|
ECONFC0303241:TUBT008,2003
| null | null |
cs.DC
| null |
The EU DataGrid has deployed a grid testbed at approximately 20 sites across
Europe, with several hundred registered users. This paper describes
authorisation systems produced by GridPP and currently used on the EU DataGrid
Testbed, including local Unix pool accounts and fine-grained access control
with Access Control Lists and Grid-aware filesystems, fileservers and web
developement environments.
|
[
{
"version": "v1",
"created": "Fri, 6 Jun 2003 10:45:43 GMT"
}
] | 2008-11-26T00:00:00 |
[
[
"McNab",
"A.",
""
]
] |
new_dataset
| 0.995797 |
cs/0306031
|
Riccardo Giannitrapani
|
Marco Frailis, Riccardo Giannitrapani
|
The FRED Event Display: an Extensible HepRep Client for GLAST
|
Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 5 pages, LaTeX, 3 eps figures. PSN
MOLT010
|
ECONFC0303241:MOLT010,2003
| null | null |
cs.GR
| null |
A new graphics client prototype for the HepRep protocol is presented. Based
on modern toolkits and high level languages (C++ and Ruby), Fred is an
experiment to test applicability of scripting facilities to the high energy
physics event display domain. Its flexible structure, extensibility and the use
of the HepRep protocol are key features for its use in the astroparticle
experiment GLAST.
|
[
{
"version": "v1",
"created": "Fri, 6 Jun 2003 12:34:53 GMT"
}
] | 2008-11-26T00:00:00 |
[
[
"Frailis",
"Marco",
""
],
[
"Giannitrapani",
"Riccardo",
""
]
] |
new_dataset
| 0.99672 |
cs/0306042
|
Ianna Osborne
|
George Alverson, Giulio Eulisse, Shahzad Muzaffar, Ianna Osborne,
Lassi A. Tuura, Lucas Taylor
|
IGUANA Architecture, Framework and Toolkit for Interactive Graphics
|
Presented at the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 6 pages LaTeX, 4 eps figures. PSN
MOLT008 More and higher res figs at
http://iguana.web.cern.ch/iguana/snapshot/main/gallery.html
|
ECONFC0303241:MOLT008,2003
| null | null |
cs.SE cs.GR
| null |
IGUANA is a generic interactive visualisation framework based on a C++
component model. It provides powerful user interface and visualisation
primitives in a way that is not tied to any particular physics experiment or
detector design. The article describes interactive visualisation tools built
using IGUANA for the CMS and D0 experiments, as well as generic GEANT4 and
GEANT3 applications. It covers features of the graphical user interfaces, 3D
and 2D graphics, high-quality vector graphics output for print media, various
textual, tabular and hierarchical data views, and integration with the
application through control panels, a command line and different
multi-threading models.
|
[
{
"version": "v1",
"created": "Tue, 10 Jun 2003 16:15:41 GMT"
}
] | 2008-11-26T00:00:00 |
[
[
"Alverson",
"George",
""
],
[
"Eulisse",
"Giulio",
""
],
[
"Muzaffar",
"Shahzad",
""
],
[
"Osborne",
"Ianna",
""
],
[
"Tuura",
"Lassi A.",
""
],
[
"Taylor",
"Lucas",
""
]
] |
new_dataset
| 0.993207 |
cs/0306080
|
Natalia M. Ratnikova
|
N. Ratnikova
|
BOA: Framework for Automated Builds
|
3 pages, 2 figures
|
ECONFC0303241:TUJT005,2003
| null | null |
cs.SE
| null |
Managing large-scale software products is a complex software engineering
task. The automation of the software development, release and distribution
process is most beneficial in the large collaborations, where the big number of
developers, multiple platforms and distributed environment are typical factors.
This paper describes Build and Output Analyzer framework and its components
that have been developed in CMS to facilitate software maintenance and improve
software quality. The system allows to generate, control and analyze various
types of automated software builds and tests, such as regular rebuilds of the
development code, software integration for releases and installation of the
existing versions.
|
[
{
"version": "v1",
"created": "Sat, 14 Jun 2003 00:07:06 GMT"
}
] | 2008-11-26T00:00:00 |
[
[
"Ratnikova",
"N.",
""
]
] |
new_dataset
| 0.993923 |
cs/0306133
|
Daniel Engh
|
D. Engh, S. Smallen, J. Gieraltowski, L. Fang, R. Gardner, D. Gannon,
R. Bramley
|
GRAPPA: Grid Access Portal for Physics Applications
|
Talk from the 2003 Computing in High Energy and Nuclear Physics
(CHEP03), La Jolla, Ca, USA, March 2003, 5 pages, LaTeX, 3 eps figures. PSN
TUCT006
|
ECONFC0303241:TUCT006,2003
| null | null |
cs.DC
| null |
Grappa is a Grid portal effort designed to provide physicists convenient
access to Grid tools and services. The ATLAS analysis and control framework,
Athena, was used as the target application. Grappa provides basic Grid
functionality such as resource configuration, credential testing, job
submission, job monitoring, results monitoring, and preliminary integration
with the ATLAS replica catalog system, MAGDA. Grappa uses Jython to combine the
ease of scripting with the power of java-based toolkits. This provides a
powerful framework for accessing diverse Grid resources with uniform
interfaces. The initial prototype system was based on the XCAT Science Portal
developed at the Indiana University Extreme Computing Lab and was demonstrated
by running Monte Carlo production on the U.S. ATLAS test-bed. The portal also
communicated with a European resource broker on WorldGrid as part of the joint
iVDGL-DataTAG interoperability project for the IST2002 and SC2002
demonstrations. The current prototype replaces the XCAT Science Portal with an
xbooks jetspeed portlet for managing user scripts.
|
[
{
"version": "v1",
"created": "Thu, 26 Jun 2003 17:09:07 GMT"
}
] | 2008-11-26T00:00:00 |
[
[
"Engh",
"D.",
""
],
[
"Smallen",
"S.",
""
],
[
"Gieraltowski",
"J.",
""
],
[
"Fang",
"L.",
""
],
[
"Gardner",
"R.",
""
],
[
"Gannon",
"D.",
""
],
[
"Bramley",
"R.",
""
]
] |
new_dataset
| 0.998241 |
0811.3449
|
William Gilreath
|
William F. Gilreath
|
Binar Shuffle Algorithm: Shuffling Bit by Bit
|
27-pages, watermarked
| null | null | null |
cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Frequently, randomly organized data is needed to avoid an anomalous operation
of other algorithms and computational processes. An analogy is that a deck of
cards is ordered within the pack, but before a game of poker or solitaire the
deck is shuffled to create a random permutation. Shuffling is used to assure
that an aggregate of data elements for a sequence S is randomly arranged, but
avoids an ordered or partially ordered permutation.
Shuffling is the process of arranging data elements into a random
permutation. The sequence S as an aggregation of N data elements, there are N!
possible permutations. For the large number of possible permutations, two of
the possible permutations are for a sorted or ordered placement of data
elements--both an ascending and descending sorted permutation. Shuffling must
avoid inadvertently creating either an ascending or descending permutation.
Shuffling is frequently coupled to another algorithmic function --
pseudo-random number generation. The efficiency and quality of the shuffle is
directly dependent upon the random number generation algorithm utilized. A more
effective and efficient method of shuffling is to use parameterization to
configure the shuffle, and to shuffle into sub-arrays by utilizing the encoding
of the data elements. The binar shuffle algorithm uses the encoding of the data
elements and parameterization to avoid any direct coupling to a random number
generation algorithm, but still remain a linear O(N) shuffle algorithm.
|
[
{
"version": "v1",
"created": "Fri, 21 Nov 2008 01:45:50 GMT"
}
] | 2008-11-24T00:00:00 |
[
[
"Gilreath",
"William F.",
""
]
] |
new_dataset
| 0.995694 |
0811.3620
|
Stefano Zacchiroli
|
Ralf Treinen (PPS), Stefano Zacchiroli (PPS)
|
Solving package dependencies: from EDOS to Mancoosi
| null |
DebConf8, Argentine (2008)
| null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mancoosi (Managing the Complexity of the Open Source Infrastructure) is an
ongoing research project funded by the European Union for addressing some of
the challenges related to the "upgrade problem" of interdependent software
components of which Debian packages are prototypical examples. Mancoosi is the
natural continuation of the EDOS project which has already contributed tools
for distribution-wide quality assurance in Debian and other GNU/Linux
distributions. The consortium behind the project consists of several European
public and private research institutions as well as some commercial GNU/Linux
distributions from Europe and South America. Debian is represented by a small
group of Debian Developers who are working in the ranks of the involved
universities to drive and integrate back achievements into Debian. This paper
presents relevant results from EDOS in dependency management and gives an
overview of the Mancoosi project and its objectives, with a particular focus on
the prospective benefits for Debian.
|
[
{
"version": "v1",
"created": "Fri, 21 Nov 2008 19:45:50 GMT"
}
] | 2008-11-24T00:00:00 |
[
[
"Treinen",
"Ralf",
"",
"PPS"
],
[
"Zacchiroli",
"Stefano",
"",
"PPS"
]
] |
new_dataset
| 0.999187 |
0811.3621
|
Stefano Zacchiroli
|
Ralf Treinen (PPS), Stefano Zacchiroli (PPS)
|
Description of the CUDF Format
| null | null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This document contains several related specifications, together they describe
the document formats related to the solver competition which will be organized
by Mancoosi. In particular, this document describes: - DUDF (Distribution
Upgradeability Description Format), the document format to be used to submit
upgrade problem instances from user machines to a (distribution-specific)
database of upgrade problems; - CUDF (Common Upgradeability Description
Format), the document format used to encode upgrade problems, abstracting over
distribution-specific details. Solvers taking part in the competition will be
fed with input in CUDF format.
|
[
{
"version": "v1",
"created": "Fri, 21 Nov 2008 19:46:46 GMT"
}
] | 2008-11-24T00:00:00 |
[
[
"Treinen",
"Ralf",
"",
"PPS"
],
[
"Zacchiroli",
"Stefano",
"",
"PPS"
]
] |
new_dataset
| 0.999531 |
0811.3328
|
Justislav Bogevolnov V
|
Justislav Bogevolnov
|
chi2TeX Semi-automatic translation from chiwriter to LaTeX
|
8 pages, 8 figures in Russian
| null | null | null |
cs.SE cs.CV
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Semi-automatic translation of math-filled book from obsolete ChiWriter format
to LaTeX. Is it possible? Idea of criterion whether to use automatic or hand
mode for translation. Illustrations.
|
[
{
"version": "v1",
"created": "Thu, 20 Nov 2008 12:49:12 GMT"
}
] | 2008-11-21T00:00:00 |
[
[
"Bogevolnov",
"Justislav",
""
]
] |
new_dataset
| 0.996865 |
0811.3140
|
J. F. J. Laros
|
Michael Hansen and Jeroen F. J. Laros
|
Desynched channels on IRCnet
|
13 pages, 3 figures, 2 algorithms
| null | null | null |
cs.NI cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we describe what a desynchronised channel on IRC is. We give
procedures on how to create such a channel and how to remove desynchronisation.
We explain which types of desynchronisation there are, what properties
desynchronised channels have, and which properties can be exploited.
|
[
{
"version": "v1",
"created": "Wed, 19 Nov 2008 15:43:50 GMT"
}
] | 2008-11-20T00:00:00 |
[
[
"Hansen",
"Michael",
""
],
[
"Laros",
"Jeroen F. J.",
""
]
] |
new_dataset
| 0.98814 |
0811.0436
|
Kees Middelburg
|
J. A. Bergstra, C. A. Middelburg
|
Instruction sequences for the production of processes
|
23 pages; acknowledgement corrected, reference updated
| null | null |
PRG0814
|
cs.PL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Single-pass instruction sequences under execution are considered to produce
behaviours to be controlled by some execution environment. Threads as
considered in thread algebra model such behaviours: upon each action performed
by a thread, a reply from its execution environment determines how the thread
proceeds. Threads in turn can be looked upon as producing processes as
considered in process algebra. We show that, by apposite choice of basic
instructions, all processes that can only be in a finite number of states can
be produced by single-pass instruction sequences.
|
[
{
"version": "v1",
"created": "Tue, 4 Nov 2008 07:24:12 GMT"
},
{
"version": "v2",
"created": "Tue, 18 Nov 2008 10:08:03 GMT"
}
] | 2008-11-18T00:00:00 |
[
[
"Bergstra",
"J. A.",
""
],
[
"Middelburg",
"C. A.",
""
]
] |
new_dataset
| 0.982504 |
0811.1878
|
Ivan Varzinczak
|
Ivan Varzinczak
|
Action Theory Evolution
|
64 pages, 19 figures
| null | null | null |
cs.AI cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Like any other logical theory, domain descriptions in reasoning about actions
may evolve, and thus need revision methods to adequately accommodate new
information about the behavior of actions. The present work is about changing
action domain descriptions in propositional dynamic logic. Its contribution is
threefold: first we revisit the semantics of action theory contraction that has
been done in previous work, giving more robust operators that express minimal
change based on a notion of distance between Kripke-models. Second we give
algorithms for syntactical action theory contraction and establish their
correctness w.r.t. our semantics. Finally we state postulates for action theory
contraction and assess the behavior of our operators w.r.t. them. Moreover, we
also address the revision counterpart of action theory change, showing that it
benefits from our semantics for contraction.
|
[
{
"version": "v1",
"created": "Wed, 12 Nov 2008 12:05:55 GMT"
}
] | 2008-11-13T00:00:00 |
[
[
"Varzinczak",
"Ivan",
""
]
] |
new_dataset
| 0.965084 |
0811.1914
|
Stephan Merz
|
Kaustuv C. Chaudhuri (MRI), Damien Doligez (INRIA Rocquencourt),
Leslie Lamport, Stephan Merz (INRIA Lorraine - LORIA)
|
A TLA+ Proof System
| null |
Knowledge Exchange: Automated Provers and Proof Assistants
(KEAPPA) (2008)
| null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe an extension to the TLA+ specification language with constructs
for writing proofs and a proof environment, called the Proof Manager (PM), to
checks those proofs. The language and the PM support the incremental
development and checking of hierarchically structured proofs. The PM translates
a proof into a set of independent proof obligations and calls upon a collection
of back-end provers to verify them. Different provers can be used to verify
different obligations. The currently supported back-ends are the tableau prover
Zenon and Isabelle/TLA+, an axiomatisation of TLA+ in Isabelle/Pure. The proof
obligations for a complete TLA+ proof can also be used to certify the theorem
in Isabelle/TLA+.
|
[
{
"version": "v1",
"created": "Wed, 12 Nov 2008 15:00:22 GMT"
}
] | 2008-11-13T00:00:00 |
[
[
"Chaudhuri",
"Kaustuv C.",
"",
"MRI"
],
[
"Doligez",
"Damien",
"",
"INRIA Rocquencourt"
],
[
"Lamport",
"Leslie",
"",
"INRIA Lorraine - LORIA"
],
[
"Merz",
"Stephan",
"",
"INRIA Lorraine - LORIA"
]
] |
new_dataset
| 0.995714 |
0811.1618
|
Chendong Li
|
Chendong Li
|
Airport Gate Assignment: New Model and Implementation
|
5 pages, 2 figures, 1 table. Accepted by ICOR 2008
| null | null | null |
cs.AI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Airport gate assignment is of great importance in airport operations. In this
paper, we study the Airport Gate Assignment Problem (AGAP), propose a new model
and implement the model with Optimization Programming language (OPL). With the
objective to minimize the number of conflicts of any two adjacent aircrafts
assigned to the same gate, we build a mathematical model with logical
constraints and the binary constraints, which can provide an efficient
evaluation criterion for the Airlines to estimate the current gate assignment.
To illustrate the feasibility of the model we construct experiments with the
data obtained from Continental Airlines, Houston Gorge Bush Intercontinental
Airport IAH, which indicate that our model is both energetic and effective.
Moreover, we interpret experimental results, which further demonstrate that our
proposed model can provide a powerful tool for airline companies to estimate
the efficiency of their current work of gate assignment.
|
[
{
"version": "v1",
"created": "Tue, 11 Nov 2008 02:33:30 GMT"
}
] | 2008-11-12T00:00:00 |
[
[
"Li",
"Chendong",
""
]
] |
new_dataset
| 0.998201 |
0712.1658
|
Kees Middelburg
|
J. A. Bergstra, C. A. Middelburg
|
Program algebra with a jump-shift instruction
|
19 pages
|
Journal of Applied Logic, 6(4):553--563, 2008
|
10.1016/j.jal.2008.07.001
|
PRG0711
|
cs.PL
| null |
We study sequential programs that are instruction sequences with jump-shift
instructions in the setting of PGA (ProGram Algebra). Jump-shift instructions
preceding a jump instruction increase the position to jump to. The jump-shift
instruction is not found in programming practice. Its merit is that the
expressive power of PGA extended with the jump-shift instruction, is not
reduced if the reach of jump instructions is bounded. This is used to show that
there exists a finite-state execution mechanism that by making use of a counter
can produce each finite-state thread from some program that is a finite or
periodic infinite sequence of instructions from a finite set.
|
[
{
"version": "v1",
"created": "Tue, 11 Dec 2007 08:53:49 GMT"
}
] | 2008-11-11T00:00:00 |
[
[
"Bergstra",
"J. A.",
""
],
[
"Middelburg",
"C. A.",
""
]
] |
new_dataset
| 0.993509 |
0802.3284
|
Hadrien M\'elot
|
V\'eronique Bruy\`ere, and Hadrien M\'elot
|
Tur\'an Graphs, Stability Number, and Fibonacci Index
|
11 pages, 3 figures
| null |
10.1007/978-3-540-85097-7_12
| null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The Fibonacci index of a graph is the number of its stable sets. This
parameter is widely studied and has applications in chemical graph theory. In
this paper, we establish tight upper bounds for the Fibonacci index in terms of
the stability number and the order of general graphs and connected graphs.
Tur\'an graphs frequently appear in extremal graph theory. We show that Tur\'an
graphs and a connected variant of them are also extremal for these particular
problems.
|
[
{
"version": "v1",
"created": "Fri, 22 Feb 2008 11:22:50 GMT"
}
] | 2008-11-10T00:00:00 |
[
[
"Bruyère",
"Véronique",
""
],
[
"Mélot",
"Hadrien",
""
]
] |
new_dataset
| 0.995083 |
0811.0952
|
Mikko Malinen
|
Mikko Malinen
|
Raptor Codes and Cryptographic Issues
|
2 pages. Submitted to the IEEE Transactions on Information Theory
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper two cryptographic methods are introduced. In the first method
the presence of a certain size subgroup of persons can be checked for an action
to take place. For this we use fragments of Raptor codes delivered to the group
members. In the other method a selection of a subset of objects can be made
secret. Also, it can be proven afterwards, what the original selection was.
|
[
{
"version": "v1",
"created": "Thu, 6 Nov 2008 14:11:16 GMT"
}
] | 2008-11-07T00:00:00 |
[
[
"Malinen",
"Mikko",
""
]
] |
new_dataset
| 0.989774 |
0811.0964
|
Andreas Blass
|
Andreas Blass (University of Michigan) and Yuri Gurevich (Microsoft
Research)
|
One useful logic that defines its own truth
| null | null | null | null |
cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Existential fixed point logic (EFPL) is a natural fit for some applications,
and the purpose of this talk is to attract attention to EFPL. The logic is also
interesting in its own right as it has attractive properties. One of those
properties is rather unusual: truth of formulas can be defined (given
appropriate syntactic apparatus) in the logic. We mentioned that property
elsewhere, and we use this opportunity to provide the proof.
|
[
{
"version": "v1",
"created": "Thu, 6 Nov 2008 15:09:43 GMT"
}
] | 2008-11-07T00:00:00 |
[
[
"Blass",
"Andreas",
"",
"University of Michigan"
],
[
"Gurevich",
"Yuri",
"",
"Microsoft\n Research"
]
] |
new_dataset
| 0.985571 |
0706.1002
|
Alexander Wolff
|
Xavier Goaoc, Jan Kratochvil, Yoshio Okamoto, Chan-Su Shin, Alexander
Wolff
|
Moving Vertices to Make Drawings Plane
|
This paper has been merged with http://arxiv.org/abs/0709.0170
| null | null | null |
cs.CG cs.CC cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A straight-line drawing $\delta$ of a planar graph $G$ need not be plane, but
can be made so by moving some of the vertices. Let shift$(G,\delta)$ denote the
minimum number of vertices that need to be moved to turn $\delta$ into a plane
drawing of $G$. We show that shift$(G,\delta)$ is NP-hard to compute and to
approximate, and we give explicit bounds on shift$(G,\delta)$ when $G$ is a
tree or a general planar graph. Our hardness results extend to
1BendPointSetEmbeddability, a well-known graph-drawing problem.
|
[
{
"version": "v1",
"created": "Thu, 7 Jun 2007 13:57:52 GMT"
},
{
"version": "v2",
"created": "Wed, 28 Nov 2007 13:14:51 GMT"
},
{
"version": "v3",
"created": "Thu, 6 Nov 2008 21:57:09 GMT"
}
] | 2008-11-06T00:00:00 |
[
[
"Goaoc",
"Xavier",
""
],
[
"Kratochvil",
"Jan",
""
],
[
"Okamoto",
"Yoshio",
""
],
[
"Shin",
"Chan-Su",
""
],
[
"Wolff",
"Alexander",
""
]
] |
new_dataset
| 0.999457 |
0809.1409
|
Anshuman Sinha
|
Anshuman Sinha, Haritha Nandela, Vijaya Balakrishna
|
Domain Specific Software Architecture for Design Center Automation
|
158 pages
| null | null | null |
cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Domain specific software architecture aims at software reuse through
construction of domain architecture reference model. The constructed reference
model presents a set of individual components and their interaction points.
When starting on a new large software project, the design engineer starts with
pre-constructed model, which can be easily browsed and picks up opportunities
of use in the new solution design. This report discusses application of domain
reference design methods by deriving domain specific reference architecture for
a product ordering system in a design center. The product in this case is
instock and special order blinds from different manufacturers in a large supply
store. The development of mature domain specific reference software
architecture for this domain is not the objective of this report. However, this
report would like to capture the method used in one such process and that is
the primary concern of this report. This report lists subjective details of
such a process applied to the domain of ordering custom and instock blinds from
a large home construction and goods supply store. This report also describes
the detailed process of derivation of knowledge models, unified knowledge
models and the reference architecture for this domain. However, this domain
model is only partially complete which may not be used for any real
applications. This report is a result of a course project undertaken while
studying this methodology.
|
[
{
"version": "v1",
"created": "Mon, 8 Sep 2008 19:07:17 GMT"
}
] | 2008-11-06T00:00:00 |
[
[
"Sinha",
"Anshuman",
""
],
[
"Nandela",
"Haritha",
""
],
[
"Balakrishna",
"Vijaya",
""
]
] |
new_dataset
| 0.992158 |
0811.0719
|
Patricia Gautier
|
Xavier Polanco (INIST), Ivana Roche (INIST), Dominique Besagni (INIST)
|
Web Usage Analysis: New Science Indicators and Co-usage
| null |
S\'eminaire VSST 2006, Lille : France (2006)
| null | null |
cs.IR stat.AP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A new type of statistical analysis of the science and technical information
(STI) in the Web context is produced. We propose a set of indicators about Web
users, visualized bibliographic records, and e-commercial transactions. In
addition, we introduce two Web usage factors. Finally, we give an overview of
the co-usage analysis. For these tasks, we introduce a computer based system,
called Miri@d, which produces descriptive statistical information about the Web
users' searching behaviour, and what is effectively used from a free access
digital bibliographical database. The system is conceived as a server of
statistical data which are carried out beforehand, and as an interactive server
for online statistical work. The results will be made available to analysts,
who can use this descriptive statistical information as raw data for their
indicator design tasks, and as input for multivariate data analysis, clustering
analysis, and mapping. Managers also can exploit the results in order to
improve management and decision-making.
|
[
{
"version": "v1",
"created": "Wed, 5 Nov 2008 13:00:52 GMT"
}
] | 2008-11-06T00:00:00 |
[
[
"Polanco",
"Xavier",
"",
"INIST"
],
[
"Roche",
"Ivana",
"",
"INIST"
],
[
"Besagni",
"Dominique",
"",
"INIST"
]
] |
new_dataset
| 0.965791 |
0810.5647
|
Gilles Villard
|
Gilles Villard (LIP)
|
Kaltofen's division-free determinant algorithm differentiated for matrix
adjoint computation
| null | null | null | null |
cs.SC cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Kaltofen has proposed a new approach in 1992 for computing matrix
determinants without divisions. The algorithm is based on a baby steps/giant
steps construction of Krylov subspaces, and computes the determinant as the
constant term of a characteristic polynomial. For matrices over an abstract
ring, by the results of Baur and Strassen, the determinant algorithm, actually
a straight-line program, leads to an algorithm with the same complexity for
computing the adjoint of a matrix. However, the latter adjoint algorithm is
obtained by the reverse mode of automatic differentiation, hence somehow is not
"explicit". We present an alternative (still closely related) algorithm for the
adjoint thatcan be implemented directly, we mean without resorting to an
automatic transformation. The algorithm is deduced by applying program
differentiation techniques "by hand" to Kaltofen's method, and is completely
decribed. As subproblem, we study the differentiation of programs that compute
minimum polynomials of lineraly generated sequences, and we use a lazy
polynomial evaluation mechanism for reducing the cost of Strassen's avoidance
of divisions in our case.
|
[
{
"version": "v1",
"created": "Fri, 31 Oct 2008 09:43:48 GMT"
}
] | 2008-11-03T00:00:00 |
[
[
"Villard",
"Gilles",
"",
"LIP"
]
] |
new_dataset
| 0.991336 |
0810.5763
|
Pablo Fierens
|
Pablo Ignacio Fierens
|
Number of wireless sensors needed to detect a wildfire
| null | null | null | null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The lack of extensive research in the application of inexpensive wireless
sensor nodes for the early detection of wildfires motivated us to investigate
the cost of such a network. As a first step, in this paper we present several
results which relate the time to detection and the burned area to the number of
sensor nodes in the region which is protected. We prove that the probability
distribution of the burned area at the moment of detection is approximately
exponential, given that some hypotheses hold: the positions of the sensor nodes
are independent random variables uniformly distributed and the number of sensor
nodes is large. This conclusion depends neither on the number of ignition
points nor on the propagation model of the fire.
|
[
{
"version": "v1",
"created": "Fri, 31 Oct 2008 19:11:42 GMT"
}
] | 2008-11-03T00:00:00 |
[
[
"Fierens",
"Pablo Ignacio",
""
]
] |
new_dataset
| 0.951885 |
0810.4993
|
Josep Rif\`a
|
J. Rifa, V. A. Zinoviev
|
New completely regular q-ary codes based on Kronecker products
|
Submitted to IT-IEEE. Theorem 1 in Section III was presented at the
2nd International Castle Meeting on Coding Theory and Applications (2ICMCTA),
Medina del Campo, Spain, September 2008.}}
| null | null | null |
cs.IT cs.DM math.CO math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
For any integer $\rho \geq 1$ and for any prime power q, the explicit
construction of a infinite family of completely regular (and completely
transitive) q-ary codes with d=3 and with covering radius $\rho$ is given. The
intersection array is also computed. Under the same conditions, the explicit
construction of an infinite family of q-ary uniformly packed codes (in the wide
sense) with covering radius $\rho$, which are not completely regular, is also
given. In both constructions the Kronecker product is the basic tool that has
been used.
|
[
{
"version": "v1",
"created": "Tue, 28 Oct 2008 09:29:28 GMT"
}
] | 2008-10-29T00:00:00 |
[
[
"Rifa",
"J.",
""
],
[
"Zinoviev",
"V. A.",
""
]
] |
new_dataset
| 0.999677 |
0810.4451
|
Herv\'e Paulino
|
Herve Paulino and Luis Lopes
|
The Mob core language and abstract machine (rev 0.2)
|
33 pages
| null | null | null |
cs.PL cs.DC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Most current mobile agent systems are based on programming languages whose
semantics are difficult to prove correct as they lack an adequate underlying
formal theory. In recent years, the development of the theory of concurrent
systems, namely of process calculi, has allowed for the first time the modeling
of mobile agent systems.Languages directly based on process calculi are,
however, very low-level and it is desirable to provide the programmer with
higher level abstractions, while keeping the semantics of the base calculus.
In this technical report we present the syntax and the semantics of a
scripting language for programming mobile agents called Mob. We describe the
language's syntax and semantics. Mob is service-oriented, meaning that agents
act both as servers and as clients of services and that this coupling is done
dynamically at run-time. The language is implemented on top of a process
calculus which allows us to prove that the framework is sound by encoding its
semantics into the underlying calculus. This provides a form of language
security not available to other mobile agent languages developed using a more
ah-doc approach.
|
[
{
"version": "v1",
"created": "Fri, 24 Oct 2008 15:02:09 GMT"
}
] | 2008-10-27T00:00:00 |
[
[
"Paulino",
"Herve",
""
],
[
"Lopes",
"Luis",
""
]
] |
new_dataset
| 0.999095 |
0810.4249
|
Marco Kuhlmann
|
Marco Kuhlmann
|
Ogden's Lemma for Regular Tree Languages
| null | null | null | null |
cs.CC
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We motivate and prove a strong pumping lemma for regular tree languages. The
new lemma can be seen as the natural correspondent of Ogden's lemma for
context-free string languages.
|
[
{
"version": "v1",
"created": "Thu, 23 Oct 2008 19:43:26 GMT"
}
] | 2008-10-24T00:00:00 |
[
[
"Kuhlmann",
"Marco",
""
]
] |
new_dataset
| 0.999588 |
0806.4627
|
Thomas Hornung
|
Michael Schmidt, Thomas Hornung, Georg Lausen, Christoph Pinkel
|
SP2Bench: A SPARQL Performance Benchmark
|
Conference paper to appear in Proc. ICDE'09
| null | null | null |
cs.DB cs.PF
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Recently, the SPARQL query language for RDF has reached the W3C
recommendation status. In response to this emerging standard, the database
community is currently exploring efficient storage techniques for RDF data and
evaluation strategies for SPARQL queries. A meaningful analysis and comparison
of these approaches necessitates a comprehensive and universal benchmark
platform. To this end, we have developed SP^2Bench, a publicly available,
language-specific SPARQL performance benchmark. SP^2Bench is settled in the
DBLP scenario and comprises both a data generator for creating arbitrarily
large DBLP-like documents and a set of carefully designed benchmark queries.
The generated documents mirror key characteristics and social-world
distributions encountered in the original DBLP data set, while the queries
implement meaningful requests on top of this data, covering a variety of SPARQL
operator constellations and RDF access patterns. As a proof of concept, we
apply SP^2Bench to existing engines and discuss their strengths and weaknesses
that follow immediately from the benchmark results.
|
[
{
"version": "v1",
"created": "Mon, 30 Jun 2008 15:31:26 GMT"
},
{
"version": "v2",
"created": "Tue, 21 Oct 2008 14:44:17 GMT"
}
] | 2008-10-21T00:00:00 |
[
[
"Schmidt",
"Michael",
""
],
[
"Hornung",
"Thomas",
""
],
[
"Lausen",
"Georg",
""
],
[
"Pinkel",
"Christoph",
""
]
] |
new_dataset
| 0.999484 |
0810.3332
|
Gheorghe Stefanescu
|
Cezara Dragoi and Gheorghe Stefanescu
|
A sound spatio-temporal Hoare logic for the verification of structured
interactive programs with registers and voices
|
21 pages, 8 figures, Invited submission for WADT'08 LNCS Proceedings
| null | null | null |
cs.PL cs.LO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Interactive systems with registers and voices (shortly, "rv-systems") are a
model for interactive computing obtained closing register machines with respect
to a space-time duality transformation ("voices" are the time-dual counterparts
of "registers"). In the same vain, AGAPIA v0.1, a structured programming
language for rv-systems, is the space-time dual closure of classical while
programs (over a specific type of data). Typical AGAPIA programs describe open
processes located at various sites and having their temporal windows of
adequate reaction to the environment. The language naturally supports process
migration, structured interaction, and deployment of components on
heterogeneous machines.
In this paper a sound Hoare-like spatio-temporal logic for the verification
of AGAPIA v0.1 programs is introduced. As a case study, a formal verification
proof of a popular distributed termination detection protocol is presented.
|
[
{
"version": "v1",
"created": "Sun, 19 Oct 2008 00:05:20 GMT"
}
] | 2008-10-21T00:00:00 |
[
[
"Dragoi",
"Cezara",
""
],
[
"Stefanescu",
"Gheorghe",
""
]
] |
new_dataset
| 0.997105 |
0810.3468
|
Muthiah Annamalai
|
Muthiah Annamalai, Leela Velusamy
|
A Call-Graph Profiler for GNU Octave
|
6 pages, 2 figures, 1 table. Fix typos
| null | null | null |
cs.PF cs.PL cs.SE
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We report the design and implementation of a call-graph profiler for GNU
Octave, a numerical computing platform. GNU Octave simplifies matrix
computation for use in modeling or simulation. Our work provides a call-graph
profiler, which is an improvement on the flat profiler. We elaborate design
constraints of building a profiler for numerical computation, and benchmark the
profiler by comparing it to the rudimentary timer start-stop (tic-toc)
measurements, for a similar set of programs. The profiler code provides clean
interfaces to internals of GNU Octave, for other (newer) profiling tools on GNU
Octave.
|
[
{
"version": "v1",
"created": "Mon, 20 Oct 2008 08:29:21 GMT"
}
] | 2008-10-21T00:00:00 |
[
[
"Annamalai",
"Muthiah",
""
],
[
"Velusamy",
"Leela",
""
]
] |
new_dataset
| 0.99921 |
0810.3564
|
Ligong Wang
|
Amos Lapidoth, Jeffrey H. Shapiro, Vinodh Venkatesan, Ligong Wang
|
The Poisson Channel at Low Input Powers
|
To be presented at IEEEI 2008, December 3-5 2008, Eilat, Israel
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The asymptotic capacity at low input powers of an average-power limited or an
average- and peak-power limited discrete-time Poisson channel is considered.
For a Poisson channel whose dark current is zero or decays to zero linearly
with its average input power $E$, capacity scales like $E\log\frac{1}{E}$ for
small $E$. For a Poisson channel whose dark current is a nonzero constant,
capacity scales, to within a constant, like $E\log\log\frac{1}{E}$ for small
$E$.
|
[
{
"version": "v1",
"created": "Mon, 20 Oct 2008 14:08:18 GMT"
}
] | 2008-10-21T00:00:00 |
[
[
"Lapidoth",
"Amos",
""
],
[
"Shapiro",
"Jeffrey H.",
""
],
[
"Venkatesan",
"Vinodh",
""
],
[
"Wang",
"Ligong",
""
]
] |
new_dataset
| 0.981548 |
0810.3641
|
Gerard Henry Edmond Duchamp
|
G\'erard Henry Edmond Duchamp (LIPN), Silvia Goodenough (LIPN), Karol
A. Penson (LPTMC)
|
Rational Hadamard products via Quantum Diagonal Operators
| null | null | null | null |
cs.SC math-ph math.CO math.MP
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We use the remark that, through Bargmann-Fock representation, diagonal
operators of the Heisenberg-Weyl algebra are scalars for the Hadamard product
to give some properties (like the stability of periodic fonctions) of the
Hadamard product by a rational fraction. In particular, we provide through this
way explicit formulas for the multiplication table of the Hadamard product in
the algebra of rational functions in $\C[[z]]$.
|
[
{
"version": "v1",
"created": "Mon, 20 Oct 2008 19:16:29 GMT"
}
] | 2008-10-21T00:00:00 |
[
[
"Duchamp",
"Gérard Henry Edmond",
"",
"LIPN"
],
[
"Goodenough",
"Silvia",
"",
"LIPN"
],
[
"Penson",
"Karol A.",
"",
"LPTMC"
]
] |
new_dataset
| 0.999865 |
0810.3203
|
David Harvey
|
David Harvey
|
A cache-friendly truncated FFT
|
14 pages, 11 figures, uses algorithm2e package
| null | null | null |
cs.SC cs.DS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
We describe a cache-friendly version of van der Hoeven's truncated FFT and
inverse truncated FFT, focusing on the case of `large' coefficients, such as
those arising in the Schonhage--Strassen algorithm for multiplication in Z[x].
We describe two implementations and examine their performance.
|
[
{
"version": "v1",
"created": "Fri, 17 Oct 2008 17:36:27 GMT"
}
] | 2008-10-20T00:00:00 |
[
[
"Harvey",
"David",
""
]
] |
new_dataset
| 0.966086 |
0810.2953
|
Onur Ozan Koyluoglu
|
Onur Ozan Koyluoglu and Hesham El Gamal
|
On Power Control and Frequency Reuse in the Two User Cognitive Channel
|
Submitted to IEEE Transactions on Wireless Communications (revised on
October 16, 2008)
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
This paper considers the generalized cognitive radio channel where the
secondary user is allowed to reuse the frequency during both the idle and
active periods of the primary user, as long as the primary rate remains the
same. In this setting, the optimal power allocation policy with single-input
single-output (SISO) primary and secondary channels is explored. Interestingly,
the offered gain resulting from the frequency reuse during the active periods
of the spectrum is shown to disappear in both the low and high signal-to-noise
ratio (SNR) regimes. We then argue that this drawback in the high SNR region
can be avoided by equipping both the primary and secondary transmitters with
multiple antennas. Finally, the scenario consisting of SISO primary and
multi-input multi-output (MIMO) secondary channels is investigated. Here, a
simple Zero-Forcing approach is shown to significantly outperform the
celebrated Decoding-Forwarding-Dirty Paper Coding strategy (especially in the
high SNR regime).
|
[
{
"version": "v1",
"created": "Thu, 16 Oct 2008 16:06:01 GMT"
}
] | 2008-10-17T00:00:00 |
[
[
"Koyluoglu",
"Onur Ozan",
""
],
[
"Gamal",
"Hesham El",
""
]
] |
new_dataset
| 0.99485 |
cs/0604088
|
Santanu Maiti Kumar
|
Santanu K. Maiti
|
How to Run Mathematica Batch-files in Background ?
|
7 pages, 1 figure
| null | null | null |
cs.MS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Mathematica is a versatile equipment for doing numeric and symbolic
computations and it has wide spread applications in all branches of science.
Mathematica has a complete consistency to design it at every stage that gives
it multilevel capability and helps advanced usage evolve naturally. Mathematica
functions work for any precision of number and it can be easily computed with
symbols, represented graphically to get the best answer. Mathematica is a
robust software development that can be used in any popular operating systems
and it can be communicated with external programs by using proper mathlink
commands.
Sometimes it is quite desirable to run jobs in background of a computer which
can take considerable amount of time to finish, and this allows us to do work
on other tasks, while keeping the jobs running. Most of us are very familiar to
run jobs in background for the programs written in the languages like C, C++,
F77, F90, F95, etc. But the way of running jobs, written in a mathematica
notebook, in background is quite different from the conventional method. In
this article, we explore how to create a mathematica batch-file from a
mathematica notebook and run it in background. Here we concentrate our study
only for the Unix version, but one can run mathematica programs in background
for the Windows version as well by using proper mathematica batch-file.
|
[
{
"version": "v1",
"created": "Sun, 23 Apr 2006 09:39:02 GMT"
},
{
"version": "v2",
"created": "Thu, 2 Oct 2008 10:54:54 GMT"
},
{
"version": "v3",
"created": "Fri, 17 Oct 2008 06:04:58 GMT"
}
] | 2008-10-17T00:00:00 |
[
[
"Maiti",
"Santanu K.",
""
]
] |
new_dataset
| 0.987561 |
0810.2666
|
Damien Chablat
|
Flavien Paccot (LASMEA), Philippe Lemoine (IRCCyN), Nicolas Andreff
(LASMEA), Damien Chablat (IRCCyN), Philippe Martinet (LASMEA)
|
A Vision-based Computed Torque Control for Parallel Kinematic Machines
| null |
IEEE International Conference on Robotics and Automation, Pasadena
: \'Etats-Unis d'Am\'erique (2008)
| null | null |
cs.RO
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, a novel approach for parallel kinematic machine control
relying on a fast exteroceptive measure is implemented and validated on the
Orthoglide robot. This approach begins with rewriting the robot models as a
function of the only end-effector pose. It is shown that such an operation
reduces the model complexity. Then, this approach uses a classical Cartesian
space computed torque control with a fast exteroceptive measure, reducing the
control schemes complexity. Simulation results are given to show the expected
performance improvements and experiments prove the practical feasibility of the
approach.
|
[
{
"version": "v1",
"created": "Wed, 15 Oct 2008 11:14:15 GMT"
}
] | 2008-10-16T00:00:00 |
[
[
"Paccot",
"Flavien",
"",
"LASMEA"
],
[
"Lemoine",
"Philippe",
"",
"IRCCyN"
],
[
"Andreff",
"Nicolas",
"",
"LASMEA"
],
[
"Chablat",
"Damien",
"",
"IRCCyN"
],
[
"Martinet",
"Philippe",
"",
"LASMEA"
]
] |
new_dataset
| 0.982398 |
0810.2697
|
Anita Das
|
L. Sunil Chandran, Anita Das, Naveen Sivadasan
|
On the cubicity of bipartite graphs
|
7 pages
| null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
{\it A unit cube in $k$-dimension (or a $k$-cube) is defined as the cartesian
product $R_1 \times R_2 \times ... \times R_k$, where each $R_i$ is a closed
interval on the real line of the form $[a_i, a_i+1]$. The {\it cubicity} of
$G$, denoted as $cub(G)$, is the minimum $k$ such that $G$ is the intersection
graph of a collection of $k$-cubes. Many NP-complete graph problems can be
solved efficiently or have good approximation ratios in graphs of low cubicity.
In most of these cases the first step is to get a low dimensional cube
representation of the given graph.
It is known that for a graph $G$, $cub(G) \leq \lfloor\frac{2n}{3}\rfloor$.
Recently it has been shown that for a graph $G$, $cub(G) \leq 4(\Delta + 1)\ln
n$, where $n$ and $\Delta$ are the number of vertices and maximum degree of
$G$, respectively. In this paper, we show that for a bipartite graph $G = (A
\cup B, E)$ with $|A| = n_1$, $|B| = n_2$, $n_1 \leq n_2$, and $\Delta' =
\min\{\Delta_A, \Delta_B\}$, where $\Delta_A = {max}_{a \in A}d(a)$ and
$\Delta_B = {max}_{b \in B}d(b)$, $d(a)$ and $d(b)$ being the degree of $a$ and
$b$ in $G$ respectively, $cub(G) \leq 2(\Delta'+2) \lceil \ln n_2 \rceil$. We
also give an efficient randomized algorithm to construct the cube
representation of $G$ in $3(\Delta'+2)\lceil \ln n_2 \rceil$ dimensions. The
reader may note that in general $\Delta'$ can be much smaller than $\Delta$.}
|
[
{
"version": "v1",
"created": "Wed, 15 Oct 2008 13:44:56 GMT"
}
] | 2008-10-16T00:00:00 |
[
[
"Chandran",
"L. Sunil",
""
],
[
"Das",
"Anita",
""
],
[
"Sivadasan",
"Naveen",
""
]
] |
new_dataset
| 0.988323 |
0810.1858
|
Anne Canteaut
|
Come Berbain (FT R&D), Olivier Billet (FT R&D), Anne Canteaut (INRIA
Rocquencourt), Nicolas Courtois, Henri Gilbert (FT R&D), Louis Goubin, Aline
Gouget, Louis Granboulan, Cedric Lauradoux (INRIA Rocquencourt), Marine
Minier (INRIA Rocquencourt), Thomas Pornin, Herve Sibert
|
SOSEMANUK: a fast software-oriented stream cipher
| null |
New Stream Cipher Designs - The eSTREAM finalists (2008) 98-118
| null | null |
cs.CR
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Sosemanuk is a new synchronous software-oriented stream cipher, corresponding
to Profile 1 of the ECRYPT call for stream cipher primitives. Its key length is
variable between 128 and 256 bits. It ac- commodates a 128-bit initial value.
Any key length is claimed to achieve 128-bit security. The Sosemanuk cipher
uses both some basic design principles from the stream cipher SNOW 2.0 and some
transformations derived from the block cipher SERPENT. Sosemanuk aims at
improv- ing SNOW 2.0 both from the security and from the efficiency points of
view. Most notably, it uses a faster IV-setup procedure. It also requires a
reduced amount of static data, yielding better performance on several
architectures.
|
[
{
"version": "v1",
"created": "Fri, 10 Oct 2008 11:53:53 GMT"
}
] | 2008-10-13T00:00:00 |
[
[
"Berbain",
"Come",
"",
"FT R&D"
],
[
"Billet",
"Olivier",
"",
"FT R&D"
],
[
"Canteaut",
"Anne",
"",
"INRIA\n Rocquencourt"
],
[
"Courtois",
"Nicolas",
"",
"FT R&D"
],
[
"Gilbert",
"Henri",
"",
"FT R&D"
],
[
"Goubin",
"Louis",
"",
"INRIA Rocquencourt"
],
[
"Gouget",
"Aline",
"",
"INRIA Rocquencourt"
],
[
"Granboulan",
"Louis",
"",
"INRIA Rocquencourt"
],
[
"Lauradoux",
"Cedric",
"",
"INRIA Rocquencourt"
],
[
"Minier",
"Marine",
"",
"INRIA Rocquencourt"
],
[
"Pornin",
"Thomas",
""
],
[
"Sibert",
"Herve",
""
]
] |
new_dataset
| 0.993535 |
0810.1316
|
Victor Yodaiken
|
Victor Yodaiken
|
The meaning of concurrent programs
|
Technical report on using recursive functions for the low level
semantics of concurrent systems
| null | null | null |
cs.DM cs.OS
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The semantics of assignment and mutual exclusion in concurrent and
multi-core/multi-processor systems is presented with attention to low level
architectural features in an attempt to make the presentation realistic.
Recursive functions on event sequences are used to define state dependent
functions and variables in ordinary (non-formal-method) algebra.
|
[
{
"version": "v1",
"created": "Tue, 7 Oct 2008 23:03:29 GMT"
}
] | 2008-10-09T00:00:00 |
[
[
"Yodaiken",
"Victor",
""
]
] |
new_dataset
| 0.987787 |
0810.1513
|
Ijaz Haider Naqvi
|
Ijaz Haider Naqvi (IETR), Tanguy P\'erennou (LAAS)
|
A DCCP Congestion Control Mechanism for Wired- cum-Wireless Environments
| null |
IEEE Wireless Communications and Networking Conference, Hong-Kong
(2007)
|
10.1109/WCNC.2007.715
| null |
cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Existing transport protocols, be it TCP, SCTP or DCCP, do not provide an
efficient congestion control mechanism for heterogeneous wired-cum-wireless
networks. Solutions involving implicit loss discrimination schemes have been
proposed but were never implemented. Appropriate mechanisms can dramatically
improve bandwidth usage over the Internet, especially for multimedia transport
based on partial reliability. In this paper we have implemented and evaluated a
congestion control mechanism that implicitly discriminates congestion and
wireless losses in the datagram congestion control protocol (DCCP) congestion
control identification (CCID) framework. The new CCID was implemented as a NS-2
module. Comparisons were made with the TCP-like CCID and showed that the
bandwidth utilization was improved by more than 30% and up to 50% in
significant setups.
|
[
{
"version": "v1",
"created": "Wed, 8 Oct 2008 19:46:24 GMT"
}
] | 2008-10-09T00:00:00 |
[
[
"Naqvi",
"Ijaz Haider",
"",
"IETR"
],
[
"Pérennou",
"Tanguy",
"",
"LAAS"
]
] |
new_dataset
| 0.99861 |
cs/0701194
|
Andrij Rovenchak
|
Solomija Buk and Andrij Rovenchak
|
Menzerath-Altmann Law for Syntactic Structures in Ukrainian
|
8 pages; submitted to the Proceedings of the International scientific
conference on Modern Methods in Linguistics held in honour of the anniversary
of Prof. Gabriel L. Altmann (October 23rd and 24th, 2006, Budmerice Castle,
Slovakia)
|
Glottotheory. Vol. 1, No. 1, pp 10-17 (2008)
| null | null |
cs.CL
| null |
In the paper, the definition of clause suitable for an automated processing
of a Ukrainian text is proposed. The Menzerath-Altmann law is verified on the
sentence level and the parameters for the dependences of the clause length
counted in words and syllables on the sentence length counted in clauses are
calculated for "Perekhresni Stezhky" ("The Cross-Paths"), a novel by Ivan
Franko.
|
[
{
"version": "v1",
"created": "Tue, 30 Jan 2007 16:58:07 GMT"
}
] | 2008-10-09T00:00:00 |
[
[
"Buk",
"Solomija",
""
],
[
"Rovenchak",
"Andrij",
""
]
] |
new_dataset
| 0.998378 |
0810.1199
|
Pascal Vaillant
|
Pascal Vaillant
|
Une grammaire formelle du cr\'eole martiniquais pour la g\'en\'eration
automatique
|
In French. 10 pages, 4 figures, LaTeX 2e using EPSF and custom
package Taln2003.sty (JC/PZ, ATALA). Proceedings of the 10th annual
French-speaking conference on Natural Language Processing: `Traitement
Automatique des Langues Naturelles' (TALN 2003), Batz-sur-mer, France, 10-14
June 2003
|
Actes de la 10eme conference annuelle sur le Traitement
Automatique des Langues Naturelles (TALN 2003), p. 255-264. Batz-sur-mer,
France, 10-14 juin 2003
| null | null |
cs.CL
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this article, some first elements of a computational modelling of the
grammar of the Martiniquese French Creole dialect are presented. The sources of
inspiration for the modelling is the functional description given by Damoiseau
(1984), and Pinalie's & Bernabe's (1999) grammar manual. Based on earlier works
in text generation (Vaillant, 1997), a unification grammar formalism, namely
Tree Adjoining Grammars (TAG), and a modelling of lexical functional categories
based on syntactic and semantic properties, are used to implement a grammar of
Martiniquese Creole which is used in a prototype of text generation system. One
of the main applications of the system could be its use as a tool software
supporting the task of learning Creole as a second language. -- Nous
pr\'esenterons dans cette communication les premiers travaux de mod\'elisation
informatique d'une grammaire de la langue cr\'eole martiniquaise, en nous
inspirant des descriptions fonctionnelles de Damoiseau (1984) ainsi que du
manuel de Pinalie & Bernab\'e (1999). Prenant appui sur des travaux
ant\'erieurs en g\'en\'eration de texte (Vaillant, 1997), nous utilisons un
formalisme de grammaires d'unification, les grammaires d'adjonction d'arbres
(TAG d'apr\`es l'acronyme anglais), ainsi qu'une mod\'elisation de cat\'egories
lexicales fonctionnelles \`a base syntaxico-s\'emantique, pour mettre en oeuvre
une grammaire du cr\'eole martiniquais utilisable dans une maquette de
syst\`eme de g\'en\'eration automatique. L'un des int\'er\^ets principaux de ce
syst\`eme pourrait \^etre son utilisation comme logiciel outil pour l'aide \`a
l'apprentissage du cr\'eole en tant que langue seconde.
|
[
{
"version": "v1",
"created": "Tue, 7 Oct 2008 14:40:19 GMT"
}
] | 2008-10-08T00:00:00 |
[
[
"Vaillant",
"Pascal",
""
]
] |
new_dataset
| 0.998898 |
0810.0763
|
Pedram Pad
|
Pedram Pad, Mahdi Soltanolkotabi, Saeed Hadikhanlou, Arash Enayati,
and Farokh Marvasti
|
Errorless Codes for Over-loaded CDMA with Active User Detection
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper we introduce a new class of codes for over-loaded synchronous
wireless CDMA systems which increases the number of users for a fixed number of
chips without introducing any errors. In addition these codes support active
user detection. We derive an upper bound on the number of users with a fixed
spreading factor. Also we propose an ML decoder for a subclass of these codes
that is computationally implementable. Although for our simulations we consider
a scenario that is worse than what occurs in practice, simulation results
indicate that this coding/decoding scheme is robust against additive noise. As
an example, for 64 chips and 88 users we propose a coding/decoding scheme that
can obtain an arbitrary small probability of error which is computationally
feasible and can detect active users. Furthermore, we prove that for this to be
possible the number of users cannot be beyond 230.
|
[
{
"version": "v1",
"created": "Sat, 4 Oct 2008 12:24:39 GMT"
}
] | 2008-10-07T00:00:00 |
[
[
"Pad",
"Pedram",
""
],
[
"Soltanolkotabi",
"Mahdi",
""
],
[
"Hadikhanlou",
"Saeed",
""
],
[
"Enayati",
"Arash",
""
],
[
"Marvasti",
"Farokh",
""
]
] |
new_dataset
| 0.987402 |
0709.0259
|
Chien-Hwa Hwang
|
Chien-Hwa Hwang and Shih-Chang Chen
|
Spectrum Sensing in Wideband OFDM Cognitive Radios
|
30 pages, 7 figures, submitted to IEEE Transactions on Signal
Processing, Aug. 2007
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, detection of the primary user (PU) signal in an orthogonal
frequency division multiplexing (OFDM) based cognitive radio (CR) system is
addressed. According to the prior knowledge of the PU signal known to the
detector, three detection algorithms based on the Neyman-Pearson philosophy are
proposed. In the first case, a Gaussian PU signal with completely known
probability density function (PDF) except for its received power is considered.
The frequency band that the PU signal resides is also assumed known. Detection
is performed individually at each OFDM sub-carrier possibly interfered by the
PU signal, and the results are then combined to form a final decision. In the
second case, the sub-carriers that the PU signal resides are known.
Observations from all possibly interfered sub-carriers are considered jointly
to exploit the fact that the presence of a PU signal interferers all of them
simultaneously. In the last case, it is assumed no PU signal prior knowledge is
available. The detection is involved with a search of the interfered band. The
proposed detector is able to detect an abrupt power change when tracing along
the frequency axis.
|
[
{
"version": "v1",
"created": "Mon, 3 Sep 2007 15:16:20 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Oct 2008 05:04:22 GMT"
}
] | 2008-10-06T00:00:00 |
[
[
"Hwang",
"Chien-Hwa",
""
],
[
"Chen",
"Shih-Chang",
""
]
] |
new_dataset
| 0.962277 |
0802.2723
|
Kenneth Mackenthun Jr.
|
Kenneth M. Mackenthun Jr
|
On strongly controllable group codes and mixing group shifts: solvable
groups, translation nets, and algorithms
|
Improved algorithm included and paper rewritten; 26 pages
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The branch group of a strongly controllable group code is a shift group. We
show that a shift group can be characterized in a very simple way. In addition
it is shown that if a strongly controllable group code is labeled with Latin
squares, a strongly controllable Latin group code, then the shift group is
solvable. Moreover the mathematical structure of a Latin square (as a
translation net) and the shift group of a strongly controllable Latin group
code are closely related. Thus a strongly controllable Latin group code can be
viewed as a natural extension of a Latin square to a sequence space. Lastly we
construct shift groups. We show that it is sufficient to construct a simpler
group, the state group of a shift group. We give an algorithm to find the state
group, and from this it is easy to construct a stronlgy controllable Latin
group code.
|
[
{
"version": "v1",
"created": "Tue, 19 Feb 2008 21:45:59 GMT"
},
{
"version": "v2",
"created": "Mon, 6 Oct 2008 02:48:01 GMT"
}
] | 2008-10-06T00:00:00 |
[
[
"Mackenthun",
"Kenneth M.",
"Jr"
]
] |
new_dataset
| 0.997139 |
0806.2360
|
Alexey Tarasov S
|
Alexey S Tarasov
|
Existence of a polyhedron which does not have a non-overlapping
pseudo-edge unfolding
|
24 pages, 20 figuers, minor grammatical changes
| null | null | null |
cs.CG
|
http://creativecommons.org/licenses/by/3.0/
|
There exists a surface of a convex polyhedron P and a partition L of P into
geodesic convex polygons such that there are no connected "edge" unfoldings of
P without self-intersections (whose spanning tree is a subset of the edge
skeleton of L).
|
[
{
"version": "v1",
"created": "Sat, 14 Jun 2008 06:57:50 GMT"
},
{
"version": "v2",
"created": "Thu, 25 Sep 2008 14:01:57 GMT"
},
{
"version": "v3",
"created": "Mon, 6 Oct 2008 10:48:45 GMT"
}
] | 2008-10-06T00:00:00 |
[
[
"Tarasov",
"Alexey S",
""
]
] |
new_dataset
| 0.963415 |
0809.3357
|
Sushmita Ruj
|
Sushmita Ruj and Bimal Roy
|
More on Combinatorial Batch Codes
| null | null | null | null |
cs.CR cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
Paterson, Stinson and Wei \cite{PSW} introduced Combinatorial batch codes,
which are combinatorial description of Batch code. Batch codes were first
presented by Ishai, Kushilevita, Ostrovsky and Sahai \cite{IKOS} in STOC'04. In
this paper we answer some of the questions put forward by Paterson, Stinson and
Wei and give some results for the general case $t>1$ which were not studied by
the authors.
|
[
{
"version": "v1",
"created": "Fri, 19 Sep 2008 12:16:14 GMT"
}
] | 2008-10-01T00:00:00 |
[
[
"Ruj",
"Sushmita",
""
],
[
"Roy",
"Bimal",
""
]
] |
new_dataset
| 0.988064 |
0809.4821
|
Jean-Marie Vanherpe
|
Jean-Luc Fouquet (LIFO), Jean-Marie Vanherpe (LIFO)
|
On Fan Raspaud Conjecture
| null | null | null | null |
cs.DM
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A conjecture of Fan and Raspaud [3] asserts that every bridgeless cubic graph
con-tains three perfect matchings with empty intersection. Kaiser and Raspaud
[6] sug-gested a possible approach to this problem based on the concept of a
balanced join in an embedded graph. We give here some new results concerning
this conjecture and prove that a minimum counterexample must have at least 32
vertices.
|
[
{
"version": "v1",
"created": "Sun, 28 Sep 2008 05:56:06 GMT"
}
] | 2008-09-30T00:00:00 |
[
[
"Fouquet",
"Jean-Luc",
"",
"LIFO"
],
[
"Vanherpe",
"Jean-Marie",
"",
"LIFO"
]
] |
new_dataset
| 0.973753 |
0809.4882
|
Aleksandrs Slivkins
|
Robert Kleinberg, Aleksandrs Slivkins and Eli Upfal
|
Multi-Armed Bandits in Metric Spaces
|
16 pages, 0 figures
| null | null | null |
cs.DS cs.LG
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In a multi-armed bandit problem, an online algorithm chooses from a set of
strategies in a sequence of trials so as to maximize the total payoff of the
chosen strategies. While the performance of bandit algorithms with a small
finite strategy set is quite well understood, bandit problems with large
strategy sets are still a topic of very active investigation, motivated by
practical applications such as online auctions and web advertisement. The goal
of such research is to identify broad and natural classes of strategy sets and
payoff functions which enable the design of efficient solutions. In this work
we study a very general setting for the multi-armed bandit problem in which the
strategies form a metric space, and the payoff function satisfies a Lipschitz
condition with respect to the metric. We refer to this problem as the
"Lipschitz MAB problem". We present a complete solution for the multi-armed
problem in this setting. That is, for every metric space (L,X) we define an
isometry invariant which bounds from below the performance of Lipschitz MAB
algorithms for X, and we present an algorithm which comes arbitrarily close to
meeting this bound. Furthermore, our technique gives even better results for
benign payoff functions.
|
[
{
"version": "v1",
"created": "Mon, 29 Sep 2008 01:58:13 GMT"
}
] | 2008-09-30T00:00:00 |
[
[
"Kleinberg",
"Robert",
""
],
[
"Slivkins",
"Aleksandrs",
""
],
[
"Upfal",
"Eli",
""
]
] |
new_dataset
| 0.988255 |
0809.5009
|
Juyul Lee
|
Juyul Lee and Nihar Jindal
|
Delay Constrained Scheduling over Fading Channels: Optimal Policies for
Monomial Energy-Cost Functions
|
submitted to the IEEE ICC 2009
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
A point-to-point discrete-time scheduling problem of transmitting $B$
information bits within $T$ hard delay deadline slots is considered assuming
that the underlying energy-bit cost function is a convex monomial. The
scheduling objective is to minimize the expected energy expenditure while
satisfying the deadline constraint based on information about the unserved
bits, channel state/statistics, and the remaining time slots to the deadline.
At each time slot, the scheduling decision is made without knowledge of future
channel state, and thus there is a tension between serving many bits when the
current channel is good versus leaving too many bits for the deadline. Under
the assumption that no other packet is scheduled concurrently and no outage is
allowed, we derive the optimal scheduling policy. Furthermore, we also
investigate the dual problem of maximizing the number of transmitted bits over
$T$ time slots when subject to an energy constraint.
|
[
{
"version": "v1",
"created": "Mon, 29 Sep 2008 16:27:27 GMT"
}
] | 2008-09-30T00:00:00 |
[
[
"Lee",
"Juyul",
""
],
[
"Jindal",
"Nihar",
""
]
] |
new_dataset
| 0.972991 |
0809.4484
|
Lane A. Hemaspaandra
|
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Joerg
Rothe
|
Llull and Copeland Voting Computationally Resist Bribery and Control
|
This 2008/9/28 version is the same as both the 2008/9/25 version at
arxiv.org and the 2008/9/25 revision of URCS TR-2008-933, except the present
version corrects a minor typo in the penultimate paragraph of Section 3
| null | null |
URCS-TR-2008-933
|
cs.GT cs.CC cs.MA
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The only systems previously known to be resistant to all the standard control
types were highly artificial election systems created by hybridization. We
study a parameterized version of Copeland voting, denoted by Copeland^\alpha,
where the parameter \alpha is a rational number between 0 and 1 that specifies
how ties are valued in the pairwise comparisons of candidates. We prove that
Copeland^{0.5}, the system commonly referred to as "Copeland voting," provides
full resistance to constructive control, and we prove the same for
Copeland^\alpha, for all rational \alpha, 0 < \alpha < 1. Copeland voting is
the first natural election system proven to have full resistance to
constructive control. We also prove that both Copeland^1 (Llull elections) and
Copeland^0 are resistant to all standard types of constructive control other
than one variant of addition of candidates. Moreover, we show that for each
rational \alpha, 0 \leq \alpha \leq 1, Copeland^\alpha voting is fully
resistant to bribery attacks, and we establish fixed-parameter tractability of
bounded-case control for Copeland^\alpha. We also study Copeland^\alpha
elections under more flexible models such as microbribery and extended control
and we integrate the potential irrationality of voter preferences into many of
our results.
|
[
{
"version": "v1",
"created": "Thu, 25 Sep 2008 19:49:38 GMT"
},
{
"version": "v2",
"created": "Sun, 28 Sep 2008 04:25:35 GMT"
}
] | 2008-09-29T00:00:00 |
[
[
"Faliszewski",
"Piotr",
""
],
[
"Hemaspaandra",
"Edith",
""
],
[
"Hemaspaandra",
"Lane A.",
""
],
[
"Rothe",
"Joerg",
""
]
] |
new_dataset
| 0.962638 |
0708.4164
|
Gilles Z\'emor
|
Philippe Gaborit and Gilles Zemor
|
Asymptotic improvement of the Gilbert-Varshamov bound for linear codes
|
Submitted to IEEE Transactions on Information Theory
|
IEEE Transactions on Information Theory, IT-54, No. 9 (2008) pp.
3865--3872.
|
10.1109/TIT.2008.928288
| null |
cs.IT math.IT
| null |
The Gilbert-Varshamov bound states that the maximum size A_2(n,d) of a binary
code of length n and minimum distance d satisfies A_2(n,d) >= 2^n/V(n,d-1)
where V(n,d) stands for the volume of a Hamming ball of radius d. Recently
Jiang and Vardy showed that for binary non-linear codes this bound can be
improved to A_2(n,d) >= cn2^n/V(n,d-1) for c a constant and d/n <= 0.499. In
this paper we show that certain asymptotic families of linear binary [n,n/2]
random double circulant codes satisfy the same improved Gilbert-Varshamov
bound.
|
[
{
"version": "v1",
"created": "Thu, 30 Aug 2007 14:05:17 GMT"
}
] | 2008-09-26T00:00:00 |
[
[
"Gaborit",
"Philippe",
""
],
[
"Zemor",
"Gilles",
""
]
] |
new_dataset
| 0.961267 |
0809.4395
|
Rudi Ball
|
Rudi Ball
|
Content Sharing for Mobile Devices
|
98 page, Masters Dissertation, 64 figures, September 2007
| null | null | null |
cs.DC cs.NI
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The miniaturisation of computing devices has seen computing devices become
increasingly pervasive in society. With this increased pervasiveness, the
technologies of small computing devices have also improved. Mobile devices are
now capable of capturing various forms of multimedia and able to communicate
wirelessly using increasing numbers of communication techniques. The owners and
creators of local content are motivated to share this content in ever
increasing volume; the conclusion has been that social networks sites are
seeing a revolution in the sharing of information between communities of
people. As load on centralised systems increases, we present a novel
decentralised peer-to-peer approach dubbed the Market Contact Protocol (MCP) to
achieve cost effective, scalable and efficient content sharing using
opportunistic networking (pocket switched networking), incentive,
context-awareness, social contact and mobile devices. Within the report we
describe how the MCP is simulated with a superimposed geographic framework on
top of the JiST (Java in Simulation Time) framework to evaluate and measure its
capability to share content between massively mobile peers. The MCP is shown in
conclusion to be a powerful means by which to share content in a massively
mobile ad-hoc environment.
|
[
{
"version": "v1",
"created": "Thu, 25 Sep 2008 12:58:40 GMT"
}
] | 2008-09-26T00:00:00 |
[
[
"Ball",
"Rudi",
""
]
] |
new_dataset
| 0.998424 |
0807.1543
|
Xiaohu Shang
|
Xiaohu Shang, Biao Chen, Gerhard Kramer, H. Vincent Poor
|
On the Capacity of MIMO Interference Channels
|
8 pages, 2 figures, submitted to Allerton 2008
| null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
The capacity region of a multiple-input-multiple-output interference channel
(MIMO IC) where the channel matrices are square and invertible is studied. The
capacity region for strong interference is established where the definition of
strong interference parallels that of scalar channels. Moreover, the sum-rate
capacity for Z interference, noisy interference, and mixed interference is
established. These results generalize known results for the scalar Gaussian IC.
|
[
{
"version": "v1",
"created": "Thu, 10 Jul 2008 00:39:06 GMT"
},
{
"version": "v2",
"created": "Thu, 25 Sep 2008 19:40:13 GMT"
}
] | 2008-09-25T00:00:00 |
[
[
"Shang",
"Xiaohu",
""
],
[
"Chen",
"Biao",
""
],
[
"Kramer",
"Gerhard",
""
],
[
"Poor",
"H. Vincent",
""
]
] |
new_dataset
| 0.976374 |
0809.4149
|
Hossein Bahramgiri
|
Hossein Bahramgiri and Farshad Lahouti
|
Block Network Error Control Codes and Syndrome-based Complete Maximum
Likelihood Decoding
| null | null | null | null |
cs.IT math.IT
|
http://arxiv.org/licenses/nonexclusive-distrib/1.0/
|
In this paper, network error control coding is studied for robust and
efficient multicast in a directed acyclic network with imperfect links. The
block network error control coding framework, BNEC, is presented and the
capability of the scheme to correct a mixture of symbol errors and packet
erasures and to detect symbol errors is studied. The idea of syndrome-based
decoding and error detection is introduced for BNEC, which removes the effect
of input data and hence decreases the complexity. Next, an efficient
three-stage syndrome-based BNEC decoding scheme for network error correction is
proposed, in which prior to finding the error values, the position of the edge
errors are identified based on the error spaces at the receivers. In addition
to bounded-distance decoding schemes for error correction up to the refined
Singleton bound, a complete decoding scheme for BNEC is also introduced.
Specifically, it is shown that using the proposed syndrome-based complete
decoding, a network error correcting code with redundancy order d for receiver
t, can correct d-1 random additive errors with a probability sufficiently close
to 1, if the field size is sufficiently large. Also, a complete maximum
likelihood decoding scheme for BNEC is proposed. As the probability of error in
different network edges is not equal in general, and given the equivalency of
certain edge errors within the network at a particular receiver, the number of
edge errors, assessed in the refined Singleton bound, is not a sufficient
statistic for ML decoding.
|
[
{
"version": "v1",
"created": "Wed, 24 Sep 2008 10:38:22 GMT"
}
] | 2008-09-25T00:00:00 |
[
[
"Bahramgiri",
"Hossein",
""
],
[
"Lahouti",
"Farshad",
""
]
] |
new_dataset
| 0.999236 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.