ppxscal/embedding_network huggingface dataset:
Design-based science learning: important challenges and how technology can make a difference
Authors: Swaroop S. Vattam, Janet L. Kolodner
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

The affordances of design activity for science learning are well-recognized. However, the implementation of design-based science learning in classrooms presents a number of significant challenges. We have been exploring some of these challenges in our design-based approach to science learning called Learning by Design (LBD). In this article, we describe two significant challenges we faced in implementing our LBD approach and present two strategies that we have implemented in our software, SIMCARS, to address them. We also present the results of a pilot study which suggest that when SIMCARS was integrated into one of LBD's science units, it helped the participants of our study to overcome the identified challenges of learning effectively from design activity.
Maintaining Materialized Relations Incrementally to Improve Performance of Ontology Query
Authors: Man Li, Xiaoyong Du, Shan Wang
Venue: Proceedings of the Seventh International Conference on Web-Age Information Management Workshops (2006)

For ontology-based applications, the efficiency of ontology query is vital. Different from existing approaches, the paper improves performance of ontology query by materializing some derived relations. Experimental results show that the integrated performance of ontology query can be improved greatly by maintaining materialized relations and the materialized relations technique has good scalability. Here the challenge is how to maintain the materialized relations incrementally with the update of ontologies. Because transitive relations are in common use in ontology, the paper proposes a novel algorithm for maintaining transitive materialized relations incrementally based on a special weighted materialized relation transitive graph, which can solve the coexistence problem of multiple derived paths better and proves the correctness of the algorithm.
PAK-based Binding Update Method for Mobile IPv6 route optimization
Authors: Ho-Sun Yoon, Rack-Hyun Kim, Sung-Back Hong, Heung-Youl Youm
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

This paper proposes an efficient and secure binding update authentication method for mobile IPv6 route optimization between a mobile node and its correspondent node. The proposed scheme assumes that the MN(Mobile Node) shares the password with the CN(Correspondent Node) and incorporates the PAK(Password-based Authenticated Key Exchange) protocol to authenticate the BU(Binding Update) message and derives the session key. Therefore, our proposed method can avoid the need of external security infrastructure like PKI (Public Key Infrastructure) and protect against the attacker who resides on the path sharing the same data link with CN.
Policy-based resource allocation in a wireless public safety network for incident scene management
Authors: Jeffrey Q. Bao, Liang Guo, Whay C. Lee
Venue: Proceedings of the 2006 workshop on Dependability issues in wireless ad hoc networks and sensor networks (2006)

We propose an Incident-Aware Early Blocking (IAEB) Policy to dynamically allocate network resource to favor first responders in a public safety network during an incident. The proposed policy detects occurrence of an incident based on offered load from first responders. Once an incident is detected, system resources are reserved for such users. We demonstrate, via simulations, that the IAEB policy can significantly reduce unnecessary preemptions of non-mission-critical users with minor loss of overall system utilization compared with a benchmark strict priority policy.
Appearance Characterization of Linear Lambertian Objects, Generalized Photometric Stereo, and Illumination-Invariant Face Recognition
Authors: Shaohua Kevin Zhou, Gaurav Aggarwal, Rama Chellappa, David W. Jacobs
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

Traditional photometric stereo algorithms employ a Lambertian reflectance model with a varying albedo field and involve the appearance of only one object. In this paper, we generalize photometric stereo algorithms to handle all appearances of all objects in a class, in particular the human face class, by making use of the linear Lambertian property. A linear Lambertian object is one which is linearly spanned by a set of basis objects and has a Lambertian surface. The linear property leads to a rank constraint and, consequently, a factorization of an observation matrix that consists of exemplar images of different objects (e.g., faces of different subjects) under different, unknown illuminations. Integrability and symmetry constraints are used to fully recover the subspace bases using a novel linearized algorithm that takes the varying albedo field into account. The effectiveness of the linear Lambertian property is further investigated by using it for the problem of illumination-invariant face recognition using just one image. Attached shadows are incorporated in the model by a careful treatment of the inherent nonlinearity in Lambert's law. This enables us to extend our algorithm to perform face recognition in the presence of multiple illumination sources. Experimental results using standard data sets are presented.
A java based api for the implementation and maintenance of domain specific collaborative virtual environments
Authors: Michael J. Laszlo
Venue:  (2006)

Collaborative virtual environments (CVEs) are environments that actively support human-human communication in addition to human-machine communication and which use the virtual environment as the user interface. The number of domains to which CVEs are being applied is constantly increasing, yet there are currently no standards governing the implementation of CVEs. Not surprisingly, most CVEs are proprietary to some degree, and are difficult to adapt to domains for which they were not originally designed. This dissertation proposes a set of abstractions common to many CVEs and presents an API named CORE (Creation of Reusable Environments) based on these abstractions for the implementation and maintenance of CVEs. Additionally, three case studies were undertaken to validate the API: a chat room, virtual classroom, and traditional multi-user dungeon (MUD). These case studies demonstrate typical uses of the API for creating CVEs. It is the finding of this research that a common set of abstractions can be identified across many CVEs and if harnessed within an API, the implementation of CVEs becomes more convenient and structured.
Hardware Implementation of Hash Function SHA-512
Authors: Hong-qiang Li, Chang-yun Miao
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

It has become clear that the current generation of cryptographic hashing algorithms are insufficient to meet future needs. Hash functions are among the most widespread cryptographic primitives, and are currently used in multiple cryptographic schemes and security protocols such as IPSec and SSL. In this paper, a hardware implementation of the newly proposed draft hash standard SHA-512 achieves high speed performance. The proposed implementation has been integrated by using VHDL and has been synthesized placed and routed in an FPGA device. In addition, it can be integrated in security systems which are used for the implementation networks for wireless protocols, with special needs of integrity in data transmission.
Blindsight in Subjects with Homonymous Visual Field Defects
Authors: Heinz Schärli, Alison M. Harman, John H. Hogben
Venue: Journal of Cognitive Neuroscience (1999)

Brain damage in the visual system can lead to apparently blind visual areas. However, more elaborate testing indicates that some visual ability may still exist for specific stimuli in the otherwise blind regions. This phenomenon is called ''blindsight'' if subjects report no conscious awareness of visual stimuli but when forced to guess, nevertheless perform better than chance. It has mainly been suggested that secondary visual pathways are responsible for this phenomenon. However, no published study has clearly shown the neural mechanism responsible for blindsight. Furthermore, experimental artifacts may have been responsible for the appearance of the phe nomenon in some subjects. In the present study, the visual fields of nine subjects were mapped and residual visual performance was examined in many areas using three different experimental procedures. Artifacts such as stray light or eye movements were well controlled. In addition, confidence ratings were required after each trial in the forced-choice tests. The results show that only one subject with a lesion in the optic radiation had blindsight in two discrete areas of the affected visual field. Spared optic radiation fibers of the main (primary) geniculo-striate visual pathway were most likely to account for this finding.
Ontology-Based Knowledge Retrieval in Organizational Memory
Authors: Kung-Jiuan Yang, Yuh-Min Chen
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Organization memory (OM) has been regarded as one of the most important resources in the enterprise. An OM captures stores and shares the valuable organization knowledge and thus esteem as a base of enterprise knowledge management. Due to the complexity of OM, structuring and accessing the huge amount of heterogeneous information will be a heavy workload. In this paper, for supporting learning and the sharing of knowledge of the informal documents, recommendations will be provided based on Case-Based Reasoning (CBR) techniques. And we propose an ontology-based approach model to retrieve formal, semi-formal or informal knowledge by specifying the meta-level description to improve the retrieval efficiency on the problems of daily task and furthermore to eliminate the possibility of information overload.
Recovering Intrinsic Images from Weighted Edge Maps
Authors: Qiang He, Chee-Hung Henry Chu
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Intrinsic images refer to the reflectance image and the illumination image. By separating the reflectance image and the illumination image from an observed image, the effects of shadows and variable illuminations on processes such as image segmentation and object recognition are considerable attenuated. An observed image is a product of its reflectance image and illumination image. We present an intrinsic image decomposition method for a single color image by assuming that sharp chromaticity changes results from reflectance changes. We first compute gradients on chromaticity. Then we multiply the edge maps of color intensity image of original image with the chromatic gradients and obtain weighted edge maps. Through weighted edge maps, we can distinguish the edges from reflectance and those from illumination. Finally, we reintegrate reflectance edge image and illumination edge image to recover the reflectance image and illumination image. The experimental results on real data are given.
Iterative algorithms for envelope constrained filter design
Authors: B. Vo, A. Cantoni, K. L. Teo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

The discrete-time envelope constrained (EC) filtering problem can be formulated as a quadratic programming (QP) problem with linear inequality constraints. In this paper, the QP problem is approximated by an unconstrained minimization problem with two parameters. These parameters can be selected so that given an acceptable deviation from the norm of the optimal EC filter, the solution to the unconstrained problem satisfies both the deviation and envelope constraints. Newton's method with line search is applied to solve the unconstrained problem iteratively.
Exercises and problems: try to solve the skyline problem
Authors: Ray Polivka
Venue: ACM SIGAPL APL Quote Quad (2004)

Suppose you are given a series of rectangular boxes laid along the positive x axis. Each box is defined by 3 integer numbers; a left x value, a height along the y axis, and a right x value. For example one triple might be (1 11 5), meaning that the box extends horizontally from x=1 to x=5, with a height on the y axis of 11 units. The rectangular boxes may overlap or intersect as well as stand alone. For example, the three boxes represented by (1 11 5), (2 6 7) and (3 13 9) represent two intersecting boxes, (1 11 5) (3 13 9) and one completely subsumed one (2 6 7).
On the Construction of a Strongly Connected Broadcast Arborescence with Bounded Transmission Delay
Authors: Yingshu Li, My T. Thai, Feng Wang, Ding-Zhu Du
Venue: IEEE Transactions on Mobile Computing (2006)

Energy conservation is an important concern in wireless networks. Many algorithms for constructing a broadcast tree with minimum energy consumption and other goals have been developed. However, no previous research work considers the total energy consumption and transmission delays of the broadcast tree simultaneously. In this paper, based on an (\alpha, \beta){\hbox{-}}{\rm tree}, a novel concept to wireless networks, we define a new Strongly connected Broadcast Arborescence with bounded Transmission delay (SBAT) problem and design the Strongly connected Broadcast Arborescence (SBA) algorithm with linear running time to construct a strongly connected broadcast tree with bounded total power, while satisfying the constraint that the transmission delays between the source and the other hosts are also bounded. We also propose the distributed version of the SBA algorithm. The theoretical analysis and simulation results show that the SBA algorithm gives a proper solution to the SBAT problem.
The Self-Study and Auto-Control Model of Machine's Lifetime Learning Based on Database
Authors: Qichang Duan, Hongbo Jin, Li Zhang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

The paper presents a novel design methodology for an intelligent controller based on a database capable of self-study and auto-control. The motivation stems from making a smart database analogous to human brain, namely, a dummy brain database (DBD). The data stored in the DBD may be collected from a plant/system at present, recent past and/or over a period of time in the past, i.e. the historical data. The proposed method intends to enable DBD to perform information processing, knowledge elicitation and decision making in a manner similar to human brain. In particular the features of human memory including its sensitivity, frequency of change, information update and reconstruction are researched and the mechanism of the brain's associative memories studied. The DBD thus established has led to a self-study and autocontrol model which is capable for learning over the machine's lifetime .Possible applications in control of a group of elevators and in city traffic control are discussed.
Detection of fading overlapping multipath components
Authors: Nabil R. Yousef, Ali H. Sayed, Nima Khajehnouri
Venue: Signal Processing (2006)

Overlapping multipath propagation is one of the main sources of mobile-positioning errors, especially in fast channel fading situations. In this paper we present a technique for detecting the existence of overlapping fading multipath components. Such information is vital for accurate resolving of overlapping multipath components as well as avoiding unnecessary computations and errors in single-path propagation cases. The proposed algorithm exploits the property that fading multipath components fade independently. An analysis of the proposed technique is performed to validate its functionality and to select the algorithm parameters. The paper also presents simulation results that show a high ability of the proposed technique to detect overlapping multipath components along with its impact on the accuracy of multipath resolving techniques.
Modeling and experimental validation of internal faults in salient pole synchronous machines including space harmonics
Authors: X. Tu, L.-A. Dessaint, M. El Kahel, A. Barry
Venue: Mathematics and Computers in Simulation (2006)

Considering the space harmonics caused by the faulted windings, a simulation model of internal faults in salient pole synchronous machines is proposed in this paper. The model is based on the winding function approach, which makes no assumption for sinusoidal symmetrical distribution of the machine windings. A new method of calculation of synchronous machine inductances is presented, in which the space harmonics produced by the windings are readily taken into account. Simulation results for internal faults on the stator windings of a generator at no load and at load are compared with experimental results to verify the accuracy of the proposed model.
DRM Encryption System using the Key Exchange with Matrix Puzzle
Authors: Yong-hoon,  Jung, Jung-jae Kim, Moon-seog Jun
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

This paper proposes more various key generation algorithms than conventional encryption method, and more secure encryption method that does not keep each symmetric key of key generation algorithm in server. After implementing proposed system, we verify the system using various sizes of video data. We get the fact that proposed system can reduce the delay time of encryption and decryption at the replay of video data.
Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
Authors: E. G. Birgin, J. M. Martínez, F. H. Nishihara, D. P. Ronconi
Venue: Computers and Operations Research (2006)

The orthogonal packing of rectangular items in an arbitrary convex region is considered in this work. The packing problem is modeled as the problem of deciding for the feasibility or infeasibility of a set of nonlinear equality and inequality constraints. A procedure based on nonlinear programming is introduced and numerical experiments which show that the new procedure is reliable are exhibited.Scope and purpose We address the problem of packing orthogonal rectangles within an arbitrary convex region. We aim to show that smooth nonlinear programming models are a reliable alternative for packing problems and that well-known general-purpose methods based on continuous optimization can be used to solve the models. Numerical experiments illustrate the capabilities and limitations of the approach.
Two methods of authenticated positioning
Authors: Thomas Mundt
Venue: Proceedings of the 2nd ACM international workshop on Quality of service security for wireless and mobile networks (2006)

Recent studies and publications have shown a demand for a secure method to proof someones or somenthings position via a communication channel. In this paper we present a concept and two architectures for location dependent access control. We start with a number of scenarios. Some of the scenarios play in a global context, some others in a more local environment. We address boths groups of scenarios with different methods of positioning (location providers). We are using a WLAN mesh network to determine the nodes' positions. We introduce a trustworthy hardware module used for positioning and controlling access to secured data. We show different types of attacks against such systems. Due to the special nature of different location providers we compare several ways how these attacks are impeded
Zero-knowledge watermark detection resistant to ambiguity attacks
Authors: Qiming Li, Ee-Chien Chang
Venue: Proceedings of the 8th workshop on Multimedia and security (2006)

A zero-knowledge watermark detector allows an owner to prove to a verifier that an image in question indeed contains the owner's watermark without revealing much information about the actual watermark. In such a scenario, the owner publishes a committed watermark before watermark detection so as to show that she knows the watermark before the detection. However, this does not imply that the owner can prove that she knows the watermark before the work appeared in the public. One well known counter example is the invertibility/ambiguity attacks where an adversary can create an ambiguous situation by deriving a forged watermark from a published work, and commits the forged watermark. Furthermore, the adversary may derive a watermark from existing non-watermarked images in the public domain and later claim ownership of them. One solution is to enforce certain constraints on the valid watermarks. In this paper we propose a zero-knowledge watermark detector that prevents the owner from cheating by ambiguity attacks. In addition, it allows the owner to publish a large number of works with different watermarks, while committing only one secret.
Joint demodulation of cochannel signals using MLSE and MAPSD algorithms
Authors: K. Giridhar, S. Chari, J. J. Shynk, R. P. Gooch
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

Sequence estimation and symbol detection algorithms for the demodulation of cochannel narrowband signals in additive noise are proposed. These algorithms are based on the maximum likelihood (ML) and maximum a posteriori (MAP) criteria for the joint recovery of both cochannel signals. The error rate performance characteristics of these nonlinear algorithms were investigated through computer simulations. The results are presented.
On consistent and asymptotically normal sample estimators for cyclic-moments and cumulants
Authors: A. V. Dandawate
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

Consistent and asymptotically normal sample estimators of cyclic-moments and cumulants are developed along with their computable covariance expressions. The analysis obviates the usual need forcibly to stationarize cyclostationary processes, and provides tools for joint exploitation of cyclostationarity and kth-order statistics in practice. Further, generalizations to asymptotic properties of sample averages of a mixture of deterministic and random signals are also given. This extension lays a common ground for treating mixtures of deterministic and random signals.
Impaired Judgments of Sadness But Not Happiness Following Bilateral Amygdala Damage
Authors: Ralph Adolphs, Daniel Tranel
Venue: Journal of Cognitive Neuroscience (2004)

Although the amygdala's role in processing facial expressions of fear has been well established, its role in the processing of other emotions is unclear. In particular, evidence for the amygdala's involvement in processing expressions of happiness and sadness remains controversial. To clarify this issue, we constructed a series of morphed stimuli whose emotional expression varied gradually from very faint to more pronounced. Five morphs each of sadness and happiness, as well as neutral faces, were shown to 27 subjects with unilateral amygdala damage and 5 with complete bilateral amygdala damage, whose data were compared to those from 12 brain damaged and 26 normal controls. Subjects were asked to rate the intensity and to label the stimuli. Subjects with unilateral amygdala damage performed very comparably to controls. By contrast, subjects with bilateral amygdala damage showed a specific impairment in rating sad faces, but performed normally in rating happy faces. Furthermore, subjects with right unilateral amygdala damage performed somewhat worse than subjects with left unilateral amygdala damage. The findings suggest that the amygdala's role in processing of emotional facial expressions encompasses multiple negatively valenced emotions, including fear and sadness.