Complex Embedding Research Articles

Light-programmable manipulation of DC field in Laplacian Meta-devices

Impressive progresses have been achieved in the field of metamaterial to mimic the illusion or camouflage effects in nature. These include invisible cloaks and many other cloak-based illusion meta-devices. However, to date many experiments only present single, static or discretized functionalities. The dynamical control of multiple kinds of illusion signals can only be achieved by embedding complex active sources directly connected to external stimuli, leading to limited on/off switching effect in a contact fashion. Here, we experimentally demonstrate a distinct scheme to incorporate multi-functions into one passive Laplacian DC meta-device, assisted by light illumination. It is shown that light-programmable cloaking, full illusion, and partial illusion can be achieved on the same device without physical contact of the heating pads or electric bias, at the cost of only four kinds of natural bulk materials with homogeneous parameters throughout. A DC network is fabricated to demonstrate the proof of concept, with measurement results in good agreement with the numerical simulations. The proposed scheme may open a new avenue to the non-contact multiphysical control of multi-illusion functions for Laplacian fields.

Iterative learning control with complex conjugate gradient optimization algorithm for multiaxial road durability test rig

Service load replication performed on multiaxial hydraulic test rigs has been widely applied in automotive engineering for durability testing in laboratory. The frequency-domain off-line iterative learning control is used to generate the desired drive file, i.e. the input signals which drive the actuators of the test rig. During the iterations an experimentally identified linear frequency-domain system model is used. As the durability test rig and the specimen under test have a strong nonlinear behavior, a large number of iterations are needed to generate the drive file. This process will cause premature deterioration to the specimen unavoidably. In order to accelerate drive file construction, a method embedding complex conjugate gradient algorithm into the conventional off-line iterative learning control is proposed to reproduce the loading conditions. The basic principle and monotone convergence of the method is presented. The drive signal is updated according to the complex conjugate gradient and the optimal learning gain. An optimal learning gain can be obtained by an estimate loop. Finally, simulations are carried out based on the identified parameter model of a real spindle-coupled multiaxial test rig. With real-life spindle forces from the wheel force transducer in the proving ground test to be replicated, the simulation results indicate that the proposed conventional off-line iterative learning control with complex conjugate gradient algorithm allows generation of drive file more rapidly and precisely compared with the state-of-the-art off-line iterative learning control. Few have been done about the proposed method before. The new method is not limited to the durability testing and can be extended to other systems where repetitive tracking task is required.

Data-Dependent Learning of Symmetric/Antisymmetric Relations for Knowledge Base Completion

Embedding-based methods for knowledge base completion (KBC) learn representations of entities and relations in a vector space, along with the scoring function to estimate the likelihood of relations between entities. The learnable class of scoring functions is designed to be expressive enough to cover a variety of real-world relations, but this expressive comes at the cost of an increased number of parameters. In particular, parameters in these methods are superfluous for relations that are either symmetric or antisymmetric. To mitigate this problem, we propose a new L1 regularizer for Complex Embeddings, which is one of the state-of-the-art embedding-based methods for KBC. This regularizer promotes symmetry or antisymmetry of the scoring function on a relation-by-relation basis, in accordance with the observed data. Our empirical evaluation shows that the proposed method outperforms the original Complex Embeddings and other baseline methods on the FB15k dataset.

Application of proxy-based MCMC and EDFM to history match a Vaca Muerta shale oil well

Embedding complex discrete fractures in reservoir simulation is required to attain more realistic flow behavior of shale reservoirs. However, using local grid refinement to model discrete fractures is computationally expensive. Nevertheless, recent developments in a methodology called Embedded Discrete Fracture Model (EDFM) have overcome the computational complexity. In this study, we develop an efficient assisted history matching (AHM) workflow using proxy-based Markov chain Monte Carlo algorithm and integrating with the EDFM preprocessor. The workflow can automatically perform history matching, production forecasting and uncertainty quantification. It has been successfully applied on a shale oil well in Vaca Muerta formation.

Turkish Children in Germany Learning Grammatical Categories in Turkish as a Mother Tongue

The paper presents and discusses findings from a recent empirical study involving 40 Turkish children aged between 4 and 6 years attending two kindergartens in Berlin in the districts of Wedding and Neukölln. They were tested for their knowledge and comprehension of different grammatical categories in Turkish. Children from Wedding were found to be much better in their knowledge of the grammatical categories in their mother tongue. The differences are statistically significant F (1, 32) = 6. 6258, p = 0. 01488 (p< 0.05). The children from the kindergarten in Neukölln demonstrated lower results in Turkish grammar comprehension and thus their achieved literacy in L1.
 References
 
 Bagdoshvili, S. (2010) Turkish Migrants in Germany. Unpublished MA Thesis. Tbilisi: Institute of European Studies.
 Barac, R., Bialystok, E. (2012) Bilingual effects on cognitive and linguistic development: role of language, cultural background, and education. Child Development, 83(2), 413-422.
 Çakir, M. (2002) The use of Turkish as the mother tongue in multicultural settings in Germany. Anadolu University Journal of Social Sciences, 2(1), 39-58
 Cummins, J. (2001). Bilingual children’s mother tongue: Why is it important for education? Rights and responsibilities of educators of bilingual-bicultural children. In: Making a Difference in the Lives of Bilingual-Bicultural Learners, (pp. 15-20). L.D. Soto, ed. New York: Peter Lang.
 Cummins, J. (2016) Intercultural education and academic achievement: a fraimwork for school based policies in multilingual schools. Intercultural Education, 26(6), 455-468.
 Haug, S. et al. (2009) Muslimisches Leben in Deutschland. Nurnberg.
 Horrocks, D. and Kolinsky, E. (1996) Turkish Culture in German Society Today. Oxford: Berghahn Books.
 Johnston, J. (2015) Factors that influence language development. In: Encyclopedia of Early childhood development [online], Tremblay, R. E., Boivin, M., Peters R. De V., (eds.). Retrieved from: http://www.child-encyclopedia.com/language-development-and-literacy/according-experts/factors-influence-language-development.
 Schmitz, Anke and Olfert Helena (2013): Minderheitssprachen im deutschen Schulwesen – Eine Analyse der Implementierung allochthoner und autochthoner Sprachen. Zeitschrift für Fremdsprachenforschung, 24(2), 203-227.
 Skutnabb-Kangas (2005) Skutnabb-Kangas, Tove (2005). Linguistic Genocide. In: Encyclopedia of Genocide and Crimes Against Humanity, 3 Volumes, (pp. 653-654). Shelton, D. (ed.). New York: Macmillan Reference, USA.
 Treffers-Daller J., Sumru Özsoy, A., Roeland van Houtet, R. (2007) (In)Complete acquisition of Turkish among Turkish German bilinguals in Germany and Turkey: An analysis of complex embeddings in narratives. The International Journal of Bilingual Education and Bilingualism, 10(3), 248-276.
 Yazıcı, Z. (1999). Almanya ve Turkiye’de Anaokuluna Devam Eden 60-76 Aylar Arasındaki Turk Cocuklarının Dil Geli’imi ile Okuma Olgunlugˇu Arasındakiıliskinin Incelenmesi [Investigation of connections between language development and reading readiness ofTurkish nursery school children aged 60-76 months in Germany and Turkey]. Ph.D. thesis, Gazi University.
 Yazıcı, Z., İlter, B., & Glover, P. (2010). How bilingual is bilingual? Mother-tongue proficiency and learning through a second language. International Journal of Early Years Education, 18(3), 259-268.

An energy-efficient internet of things (IoT) architecture for preventive conservation of cultural heritage

Internet of Things (IoT) technologies can facilitate the preventive conservation of cultural heritage (CH) by enabling the management of data collected from electronic sensors. This work presents an IoT architecture for this purpose. Firstly, we discuss the requirements from the artwork standpoint, data acquisition, cloud processing and data visualization to the end user. The results presented in this work focuses on the most critical aspect of the architecture, which are the sensor nodes. We designed a solution based on LoRa and Sigfox technologies to produce the minimum impact in the artwork, achieving a lifespan of more than 10 years. The solution will be capable of scaling the processing and storage resources, deployed either in a public or on-premise cloud, embedding complex predictive models. This combination of technologies can cope with different types of cultural heritage environments.

Matrix embedding in steganography with binary Reed–Muller codes

This study presents a modified majority-logic decoding algorithm of Reed-Muller (RM) codes for matrix embedding (ME) in steganography. An ME algorithm uses linear block code to improve the embedding efficiency in steganography. The optimal embedding algorithm in steganography is equivalent to the maximum likelihood decoding (MLD) algorithm in error-correcting codes. The main disadvantage of ME is that the equivalent MLD algorithm of lengthy embedding codes requires highly complex embedding. This study used RM codes to embed data in binary host images. The authors propose a novel low-complexity embedding algorithm that uses a modified majority-logic algorithm to decode RM codes, in which a message-passing algorithm (i.e. sum-product, min-sum, or bias propagation) is performed on the highest order of information bits in the RM codes. The experimental results indicate that integrating bias propagation into the proposed scheme achieves superior embedding efficiency (relative to when the sum-product or min-sum algorithm is used) and can even achieve the embedding bound of RM codes.

Excited state gradients for a state-specific continuum solvation approach: The vertical excitation model within a Lagrangian TDDFT formulation.

The accurate modeling of the environment response is a fundamental challenge for accurately describing the photophysics and photochemistry of molecules both in solution and in more complex embeddings. When large rearrangements of the electron density occur after an electronic transition, state-specific formulations, such as the vertical excitation model, are necessary to achieve a proper modeling of the processes. Such a state-specific model is fundamental not only to obtain accurate energies, but also to follow the geometrical relaxation accompanying the evolution of the excited-states. This study presents the analytical expression of the gradients of the vertical excitation model approach by a Lagrangian formulation in the time dependent density functional theory framework. Representative organic chromophores in solution are used to test the reliability of the implementation and provide comparisons with the linear response description.

On a microscopic representation of space–time IV

We summarize some previous work on SU(4) describing hadron representations and transformations as well as its noncompact “counterpart” SU*(4) being the complex embedding of SL(2,H). So after having related the 16-dim Dirac algebra to SU*(4), on the one hand we have access to real, complex, and quaternionic Lie group chains and their respective algebras, on the other hand it is of course possible to relate physical descriptions to the respective representations. With emphasis on the common maximal compact subgroup USp(4), we are led to projective geometry of the real 3-space and various transfer principles which we use to extend the previous work on the rank 3-algebras above. On real spaces, such considerations are governed by the groups SO(n,m) with n + m = 6. The central thread, however, focuses here on line and Complex geometry which finds its well-known counterparts in descriptions of electromagnetism and special relativity as well as—using transfer principles—in Dirac, gauge, and quantum field theory. We discuss a simple picture where Complexe of second grade play the major and dominant rôle to unify (real) projective geometry, complex representation theory and line/Complex representations in order to proceed to dynamics.

From motives to comodules over the motivic Hopf algebra

We construct the natural functor from the triangulated category of motives (over a field endowed with a complex embedding) to the triangulated category of homotopy comodules over the motivic homotopy Hopf algebra.

Semi-fragile Image Authentication based on CFD and 3-bit Quantization

There is a great adventure of watermarking usage in the context of conventional authentication since it does not require additional storage space for supplementary metadata. However, JPEG compression, being a conventional method to compress images, leads to exact authentication breaking. We discuss a semi-fragile watermarking system for digital images tolerant to JPEG/JPEG2000 compression. Recently we have published a selective authentication method based on Zernike moments. But unfortunately it has large computational complexity and not sufficiently good detection of small image modifications. In the current paper it is proposed (in contrast to Zernike moments approach) the usage of image finite differences and 3-bit quantization as the main technique. In order to embed watermark (WM) into the image, some areas of the Haar wavelet transform coefficients are used. Simulation results show a good resistance of this method to JPEG compression with CR≤30% (Compression Ratio), high probability of small image modification recognition, image quality assessments PSNR≥40 dB (Peak signal-to-noise ratio) and SSIM≥0.98 (Structural Similarity Index Measure) after embedding and lower computation complexity of WM embedding and extraction. All these properties qualify this approach as effective.

Knowledge graph completion via complex tensor factorization

In statistical relational learning, knowledge graph completion deals with automatically understanding the structure of large knowledge graphs--labeled directed graphs-- and predicting missing relationships--labeled edges. State-of-the-art embedding models propose different trade-offs between modeling expressiveness, and time and space complexity. We reconcile both expressiveness and complexity through the use of complex-valued embeddings and explore the link between such complex-valued embeddings and unitary diagonalization. We corroborate our approach theoretically and show that all real square matrices--thus all possible relation/adjacency matrices--are the real part of some unitarily diagonalizable matrix. This results opens the door to a lot of other applications of square matrices factorization. Our approach based on complex embeddings is arguably simple, as it only involves a Hermitian dot product, the complex counterpart of the standard dot product between real vectors, whereas other methods resort to more and more complicated composition functions to increase their expressiveness. The proposed complex embeddings are scalable to large data sets as it remains linear in both space and time, while consistently outperforming alternative approaches on standard link prediction benchmarks.

On Distances in Lattices from Algebraic Number Fields

In this paper, we study a classical construction of lattices from number fields and obtain a series of new results about their minimum distance and other characteristics by introducing a new measure of algebraic numbers. In particular, we show that when the number fields have few complex embeddings, the minimum distances of these lattices can be computed exactly.

Image watermarking algorithm based on DCT and Arnold transform

According to the safety of the medical image in medical information system, the robust watermarking method is put forward, and it is suitable for medical image authentication and protection. Firstly, the visual feature vectors of medical image are obtained through DCT transformation, which is used to make watermark's embedding and extraction. Then, chaotic encryption technique is used in watermark to improve the security of watermark information. Lastly, the zero watermarking concepts are combined to get the watermark with the qualities against conventional watermark attacks and geometric attacks. The experimental results show that the method can effectively extract the watermark information, and has good invisibility and robustness. In addition, compared with the existing watermarking technology, this method can not only reduce the complexity of the watermark embedding, but can improve the capacity of watermark embedding and it has better flexibility and practicability.

Image watermarking algorithm based on DCT and Arnold transform

According to the safety of the medical image in medical information system, the robust watermarking method is put forward, and it is suitable for medical image authentication and protection. Firstly, the visual feature vectors of medical image are obtained through DCT transformation, which is used to make watermark's embedding and extraction. Then, chaotic encryption technique is used in watermark to improve the security of watermark information. Lastly, the zero watermarking concepts are combined to get the watermark with the qualities against conventional watermark attacks and geometric attacks. The experimental results show that the method can effectively extract the watermark information, and has good invisibility and robustness. In addition, compared with the existing watermarking technology, this method can not only reduce the complexity of the watermark embedding, but can improve the capacity of watermark embedding and it has better flexibility and practicability.

Fan-Out Packaging: Technologies and market trends

The semiconductor industry is facing a new era in which device scaling and cost reduction will not continue on the path they followed for the past few decades, with Moore's law in its foundation. Advanced nodes do not bring the desired cost benefit anymore and R&D investments in new lithography solutions and devices below 10nm nodes are rising substantially. In order to answer market demands, the industry seeks further performance and functionality boosts in integration. While scaling options remain uncertain in the shorter term and continue to be investigated, the spotlight turns to advanced packages. Emerging packages such as fan-out wafer level solution aim to bridge the gap and revive the cost/performance curve while at the same time adding more functionality through integration. In this work we will focus on Fan-Out packaging, an embedded package of most interest at the moment. The principle of Fan-Out technology is to embed products in a mold compound and allow redistribution layer pitch to be independent from die size. This approach is already mature for several years thanks to high volume products claimed by Nanium and JCET/Stats ChipPAC using eWLB type of Fan-Out, and with many other developments from OSATs and an aggressive technology from TSMC (inFO). 2016 was a turning point for the Fan-Out market with Apple A1O application processor being packaged using TSMC solution. This partnership changed the game and may create a trend of acceptance of Fan-Out packages for complex applications. The market for Fan-Out packages in 2016 already reached $500M, with potential breakthrough events in store in 2017 that could make the market reach $2B in 2020. Understanding the potential of that market and the high demand from telecom industry for a thin and cheap package, capable of embedding complex ICs, other important OSATs like Powertech or Amkor are willing to enter the market with their own technologies. TSMC being the first example, foundries too could look at the OSATs reserved market through wafer-level packages, Samsung's reaction being interesting to follow. Each player has its own view on how to gain market share and meet the technical and financial challenges associated to Fan-Out packaging such as cost reduction, yield improvement, die shift… This work brings analysis of the strategies and offers of main players involved and describes potential success scenarios for them. It also helps to define what is Fan-Out Packaging and what are the different products and platforms, player per player, avoiding confusion already visible in the industry where many players call their solution a “Fan-Out” to benefit from the buzz created by Apple despite having significant differences from one to another (chip-first, chip-last, face-up, face-down, etc…). As package price represents the final verdict, carrier size evolution is also an important topic, both for wafers and panels, since it can help to drastically reduce the cost. This work shows that the main trend is still to keep wafer carriers but some players are already investing and developing panel-based solution and we expect volume production soon. While end-customers are pushing for a switch to panel, numerous challenges are limiting its widespread though. This work describes technical, economic and maturity challenges associated to panel manufacturing. Overall, the presentation will provide an overview of the products announcements, commercialization roadmaps as well as market forecasts per application. Insights and trends into the different fan-out packaging approaches by applications, business models and major players will be reviewed.

A construction of complete complex hypersurfaces in the ball with control on the topology

Abstract Given a closed complex hypersurface Z ⊂ ℂ N + 1 {Z\subset\mathbb{C}^{N+1}} ( N ∈ ℕ {N\in\mathbb{N}} ) and a compact subset K ⊂ Z {K\subset Z} , we prove the existence of a pseudoconvex Runge domain D in Z such that K ⊂ D {K\subset D} and there is a complete proper holomorphic embedding from D into the unit ball of ℂ N + 1 {\mathbb{C}^{N+1}} . For N = 1 {N=1} , we derive the existence of complete properly embedded complex curves in the unit ball of ℂ 2 {\mathbb{C}^{2}} , with arbitrarily prescribed finite topology. In particular, there exist complete proper holomorphic embeddings of the unit disc 𝔻 ⊂ ℂ {\mathbb{D}\subset\mathbb{C}} into the unit ball of ℂ 2 {\mathbb{C}^{2}} . These are the first known examples of complete bounded embedded complex hypersurfaces in ℂ N + 1 {\mathbb{C}^{N+1}} with any control on the topology.

Design tools for reporter strands and DNA origami scaffold strands

Self-assembly using DNA origami methods requires determining a route for the scaffolding strand through the targeted structure. Here we provide strategies and software tools for determining optimal routes for reporter or scaffolding strands through graph-like (ball-and-rod) constructs. The approach applies to complex constructs, for example arbitrary geometric embeddings of graphs rather than surface meshes, lattice subsets, and meshes on higher genus surfaces than spheres. The software notably allows the user the flexibility of specifying ranked preferences for augmenting edges and for the possible configurations of branched junctions. The greater topological complexity of arbitrary graph embeddings and meshes on higher genus surfaces can result in scaffolding strand routes that are knotted in 3 space, so we also present necessary caveats for these settings.

Complete bounded embedded complex curves in $\mathbb C^2$

We prove that any convex domain of \mathbb C^2 carries properly embedded complete complex curves. In particular, we give the first examples of complete bounded embedded complex curves in \mathbb C^2 .

Inhomogeneous minima of mixed signature lattices

We establish an explicit upper bound for the Euclidean minimum of a number field which depends, in a precise manner, only on its discriminant and the number of real and complex embeddings. Such bounds were shown to exist by Davenport and Swinnerton-Dyer ([9–11]). In the case of totally real fields, an optimal bound was conjectured by Minkowski and it is proved for fields of small degree. In this note we develop methods of McMullen ([20]) in the case of mixed signature in order to get explicit bounds for the Euclidean minimum.